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 {

	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		boolean hasPattern = false;
		for (int i = 0; i <= N && hasPattern == false; i += 4) {
			for (int j = 0; j <= N && hasPattern == false; j += 7) {
				int sum = i + j;
				if (sum == N)
					hasPattern = true;
			}
		}
		System.out.println(hasPattern ? "Yes" : "No");
		sc.close();
	}
}