#include<bits/stdc++.h>

using namespace std;
using ll=long long;
#define rep2(i, a, n) for(int i = (a); i < (n); i++)
#define rep(i, n) rep2(i,0,n)

ll is_prime(ll n){
  int ans=0;
  for(ll i=2;i*i<=n;i++){
    if(n%i==0)n/=i;ans++;
  }
  if(n!=1)ans++;
  return ans;
}

int main(){
  cin.tie(nullptr);ios_base::sync_with_stdio(false);
  ll n;cin>>n;
  cout<<(is_prime(n)<3?"NO":"YES")<<endl;
}