#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long powmod(long long a, long long b, long long MOD) {
  long long ans = 1;
  while (b) {
    if (b % 2) ans = ans * a % MOD;
    a = a * a % MOD;
    b /= 2;
  }
  return ans;
}
const int N = 2e5 + 11;
string a;
map<char, int> p;
int main() {
  ios::sync_with_stdio(false);
  int a;
  cin >> a;
  if (a == 2 || a == 3 || a == 4 || a == 5 || a == 46 || a == 12 || a == 30 ||
      a == 35 || a == 43 || a == 52 || a == 64 || a == 86) {
    cout << "YES" << endl;
    return 0;
  }
  cout << "NO" << endl;
  return 0;
}

### Prompt

Create a solution in cpp for 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;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long powmod(long long a, long long b, long long MOD) {
  long long ans = 1;
  while (b) {
    if (b % 2) ans = ans * a % MOD;
    a = a * a % MOD;
    b /= 2;
  }
  return ans;
}
const int N = 2e5 + 11;
string a;
map<char, int> p;
int main() {
  ios::sync_with_stdio(false);
  int a;
  cin >> a;
  if (a == 2 || a == 3 || a == 4 || a == 5 || a == 46 || a == 12 || a == 30 ||
      a == 35 || a == 43 || a == 52 || a == 64 || a == 86) {
    cout << "YES" << endl;
    return 0;
  }
  cout << "NO" << endl;
  return 0;
}

```