La Confiserie d'ABC sells cakes at 4 dollars each and doughnuts at 7 dollars each. Determine if there is a way to buy some of them for exactly N dollars. You can buy two or more doughnuts and two or more cakes, and you can also choose to buy zero doughnuts or zero cakes.

Constraints

* N is an integer between 1 and 100, inclusive.

Input

Input is given from Standard Input in the following format:


N


Output

If there is a way to buy some cakes and some doughnuts for exactly N dollars, print `Yes`; otherwise, print `No`.

Examples

Input

11


Output

Yes


Input

40


Output

Yes


Input

3


Output

No
import java.util.*;
public class Main{
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int c = 4;
    int d = 7;
    int count = sc.nextInt();
    int total = 0;
    String answer = "No";
    for(int i=0;i<30;i++) {
      for(int j=0;j<30;j++) {
      	total = c * i + d * j;
        if(total == count) {
          answer = "Yes";
        }
      }
  	}
    System.out.println(answer);
  }
}