#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using ll = long long;

int main(void){
  ll n; cin >> n;
  if(n==1){
    cout << "NO" << endl; return 0;
  }
  int nn=1e7+1;
  vector<int> yakusu(nn+1, -1), prime;
  for(int i=2; i<=nn; i++){
    if(yakusu[i]!=-1) continue;
    int copy=i;
    prime.push_back(i);
    while(copy<=nn){
      if(yakusu[copy]==-1) yakusu[copy]=i;
      copy+=i;
    }
  } 
  int cnt=0;
  for(auto p:prime){
    if(n%p==0){
      cnt++;
      while(n%p==0) n/=p;
    }
  }
  if(n>1) cnt++;
  cout << (cnt>=3?"YES":"NO") << endl;
  return 0; 
}