#include<cstdio>
using namespace std;

int main(){
	int N;
	scanf("%d",&N);
	if((N==1)||(N==2)||(N==3)||(N==5)||(N==6)||(N==9)||(N==10)||(N==13)||(N==17))printf("No");
	else printf("Yes");
	return 0;
}

### Prompt

Please formulate a cpp solution to the following problem:

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

### Response

```cpp
#include<cstdio>
using namespace std;

int main(){
	int N;
	scanf("%d",&N);
	if((N==1)||(N==2)||(N==3)||(N==5)||(N==6)||(N==9)||(N==10)||(N==13)||(N==17))printf("No");
	else printf("Yes");
	return 0;
}

```