#include<stdio.h>
int main()
{
	int t=0,i,j,a,b,n,k;
	scanf("%d",&n);
	for(i=0;i<25;i++)
	{
		for(j=0;j<25-i;j++)
		{
			if(i*4+j*7==n)t=1;
		}
	}
	if(t)printf("Yes");
	else printf("No");
	return 0;
}
### Prompt

Generate 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<stdio.h>
int main()
{
	int t=0,i,j,a,b,n,k;
	scanf("%d",&n);
	for(i=0;i<25;i++)
	{
		for(j=0;j<25-i;j++)
		{
			if(i*4+j*7==n)t=1;
		}
	}
	if(t)printf("Yes");
	else printf("No");
	return 0;
}
```