#include <bits/stdc++.h>
using namespace std;
const int maxn = 25;
int n;
int qian[10];
int Map[maxn];
int main() {
  qian[3] = 1;
  qian[4] = 1;
  qian[5] = 1;
  qian[6] = 1;
  qian[8] = 1;
  Map[1] = 0;
  Map[2] = 1;
  Map[3] = 1;
  Map[4] = 1;
  Map[5] = 1;
  Map[6] = 1;
  Map[7] = 0;
  Map[8] = 1;
  Map[9] = 0;
  Map[10] = 0;
  for (int i = 11; i <= 20; i++) {
    Map[i] = 0;
  }
  Map[12] = 1;
  cin >> n;
  if (n <= 20) {
    if (Map[n] == 1)
      printf("YES");
    else
      printf("NO");
    return 0;
  }
  int shi = (n / 10);
  int ge = n % 10;
  if (qian[shi] == 1 && Map[ge] == 1)
    printf("YES");
  else if (qian[shi] == 1 && ge == 0)
    printf("YES");
  else
    printf("NO");
}

### Prompt

Your challenge is to write a CPP solution to the following problem:



Input

The input contains a single integer a (1 ≤ a ≤ 99).

Output

Output "YES" or "NO".

Examples

Input


5


Output


YES


Input


13


Output


NO


Input


24


Output


NO


Input


46


Output


YES

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const int maxn = 25;
int n;
int qian[10];
int Map[maxn];
int main() {
  qian[3] = 1;
  qian[4] = 1;
  qian[5] = 1;
  qian[6] = 1;
  qian[8] = 1;
  Map[1] = 0;
  Map[2] = 1;
  Map[3] = 1;
  Map[4] = 1;
  Map[5] = 1;
  Map[6] = 1;
  Map[7] = 0;
  Map[8] = 1;
  Map[9] = 0;
  Map[10] = 0;
  for (int i = 11; i <= 20; i++) {
    Map[i] = 0;
  }
  Map[12] = 1;
  cin >> n;
  if (n <= 20) {
    if (Map[n] == 1)
      printf("YES");
    else
      printf("NO");
    return 0;
  }
  int shi = (n / 10);
  int ge = n % 10;
  if (qian[shi] == 1 && Map[ge] == 1)
    printf("YES");
  else if (qian[shi] == 1 && ge == 0)
    printf("YES");
  else
    printf("NO");
}

```