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 = 0;
	public static void main(String[] args) {
		Scanner reader = new Scanner(System.in);
		N = reader.nextInt();;
		reader.close();
		if (execute(0)) {
			System.out.print("Yes");
		} else { 
			System.out.print("No");
		}
	}
	public static boolean execute(int num) {
		if (num < N) {
			return execute(num + 4) || execute(num + 7);
		} else {
			return  (num == N);
		}
	}
}
