#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;
#define al(a) a.begin(), a.end()
#define ral(a) a.rbegin(), a.rend()
#define sz(a) (int)a.size()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define db(a, b) cout << #a << ": " << a << " " << #b << ": " << b << endl;

int main() {
  ll n;
  cin >> n;

  //   for (ll i = 2; i * i <= n; ++i) {
  //     if (n % i == 0 && i * i != n) {
  //       cout << "YES" << endl;
  //       return 0;
  //     }
  //   }

  auto divisor = [&](ll n) {
    vector<ll> res;
    for (ll i = 2; i * i <= n; ++i) {
      if (n % i) continue;
      res.push_back(i);
      if (n / i != i) res.push_back(n / i);
    }
    return res;
  };
  auto div = divisor(n);
  for (auto d : div) {
    auto res = divisor(d);
    if (sz(res)) {
      cout << "YES" << endl;
      return 0;
    }
  }
  cout << "NO" << endl;
  return 0;
}