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.*;
import java.io.*;

public class Main{
	public static void main(String[] args) {
		int n;
		Scanner sc = new Scanner(System.in);
		n = sc.nextInt();
		while(n >= 4){
			if(n % 4 == 0 || n % 7 == 0){
				System.out.println("Yes");
				return;
			}
			else if(n > 4){
				n = n - 4;
			}
			else if(n > 7){
				n = n - 7;
			}
		}
		System.out.println("No");
	}
}
