

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
#include <bits/stdc++.h>
using namespace std;
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.second < b.second);
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
vector<long long> adj[1000000];
vector<bool> visited(1000000, 0);
vector<long long> color(1000000, 0);
long long n;
long long ans = 0;
void DFSUtil(long long u) {
  cout << u << " ";
  visited[u] = true;
  for (long long i = 0; i < adj[u].size(); i++) {
    if (visited[adj[u][i]] == false) {
      DFSUtil(adj[u][i]);
    }
  }
}
void DFS(long long n) {
  for (long long u = 1; u <= n; u++) {
    if (visited[u] == false) {
      DFSUtil(u);
    }
  }
}
void aE(long long u, long long v) { adj[u].push_back(v); }
vector<long long> v(1000000, 0);
vector<long long> segTree(1000000, 0);
void build(long long low, long long high, long long pos) {
  if (low == high) {
    segTree[pos] = v[low];
    return;
  }
  long long mid = (low + high) / 2;
  build(low, mid, pos * 2);
  build(mid + 1, high, pos * 2 + 1);
  segTree[pos] = segTree[pos * 2] + segTree[pos * 2 + 1];
}
long long querry(long long low, long long high, long long l, long long r,
                 long long pos) {
  if (l <= low && r >= high)
    return segTree[pos];
  else if (r < low || l > high)
    return 0;
  long long mid = (low + high) / 2;
  return querry(low, mid, l, r, 2 * pos) +
         querry(mid + 1, high, l, r, 2 * pos + 1);
}
void update(long long low, long long high, long long index, long long val,
            long long pos) {
  if (low == high) {
    v[index] = val;
    segTree[pos] = val;
  } else {
    long long mid = (low + high) / 2;
    if (low <= index && index <= mid)
      update(low, mid, index, val, 2 * pos);
    else
      update(mid + 1, high, index, val, 2 * pos + 1);
    segTree[pos] = segTree[2 * pos] + segTree[2 * pos + 1];
  }
}
int main() {
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n;
  cin >> n;
  if (n % 10 == 1 || n % 10 == 7 || n % 10 == 9)
    cout << "NO";
  else if (n == 12)
    cout << "YES";
  else if (n / 10 == 1 || n / 10 == 2 || n / 10 == 7 || n / 10 == 9)
    cout << "NO";
  else
    cout << "YES";
}
