#include <cstdio>

int main() {
  int N;
  scanf("%d", &N);

  for (int i = 0; i < 100; ++i)
    for (int j = 0; j < 100; ++j)
      if (4*i + 7*j == N)
        return puts("Yes"), 0;

  puts("No");
}
### Prompt

Your task is to create 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>

int main() {
  int N;
  scanf("%d", &N);

  for (int i = 0; i < 100; ++i)
    for (int j = 0; j < 100; ++j)
      if (4*i + 7*j == N)
        return puts("Yes"), 0;

  puts("No");
}
```