#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

vector <int> prime_factors(int n) {
  int i = 2;
  vector <int> factors;
  while (i * i <= n) {
    if (n % i) i++;
    else {
      n /= i;
      factors.push_back(i);
    }
  } if (n > 1) factors.push_back(n);
  return factors;
}

int main(void) {
#ifdef DEBUG
  freopen("input.txt", "r", stdin);
#endif

  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  int N;
  cin >> N;
  vector <int> ret;
  ret = prime_factors(N);
  if (ret.size() > 2)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}