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 {

	static int N;
	static boolean match;

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		N = sc.nextInt();
		dfs(0, 0);
		System.out.println(match ? "Yes" : "No");
	}

	static void dfs(int x, int y) {
		if (x * 4 + y * 7 > N)
			return;
		if (x * 4 + y * 7 == N) {
			match = match || true;
		}
		dfs(x + 1, y);
		dfs(x, y + 1);
	}
}
