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.Scanner;

public class Main {

	/** ケーキの値段 */
	private static final int CAKE = 4;
	/** ドーナツの値段 */
	private static final int DOUGHNUT = 7;

	public static void main(String[] args) {
		try (Scanner scanner = new Scanner(System.in)) {
			int n = scanner.nextInt();
			for (int i = 0; i <= n / CAKE; i++) {
				if (0 == (n - CAKE * i) % DOUGHNUT) {
					System.out.println("Yes");
					return;
				}
			}
			System.out.println("No");
		}
	}
}
