#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

#define rep(i, a, b) for(ll i = (ll)a; i < (ll)b; i++)
#define irep(i, v) for(auto i = (v).begin(); i != (v).end(); i++)
#define ALL(v) (v).begin(), (v).end()
#define SZ(v) (ll)(v).size()

const ll INF = 1e18;
const ld EPS = 1e-10;

bool is_prime(ll n){
  if(n <= 1) return false;
  bool res = 1;
  for(ll i = 2; i * i <= n; i++){
    res = res && !(n % i == 0);
  }
  return res;
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  srand((unsigned)time(NULL));
  cout << fixed << setprecision(20);


  ll n;
  cin >> n;
  vector<ll> fac;
  for(ll i = 1; i * i <= n; i++){
    if(n % i == 0){
      fac.push_back(i);
      if(i * i != n) fac.push_back(n / i);
    }
  }
  sort(ALL(fac));

  bool f = 0;
  rep(i, 0, SZ(fac)){
    ll m = fac[i];
    if(m == 1 || m == n || is_prime(m)) continue;
    if(n % m == 0) f = 1;
  }
  if(f) cout << "YES" << endl;
  else cout << "NO" << endl;




  return 0;
}