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
public class Main {
	public static void main(String[] args) {
		int n = new java.util.Scanner(System.in).nextInt();
		
		for (int i = 0; i <= n / 4; i++) {
			// 4ドルのケーキの金額 (4ドル x i個)
			int a = i * 4;
			for (int j = 0; j <= n / 7; j++) {
				// 7ドルのケーキの金額(7ドル x j個)
				int b = j * 7;
				if (a + b == n) {
					System.out.println("Yes");
					return;
				}
			}
		}
		System.out.println("No");
	}
}