#include <bits/stdc++.h>

using namespace std;

#define MAX 10000010
bool prime[MAX];

typedef unsigned long long ull;

void sieve() {
  fill(prime, prime+MAX, true);
  prime[0] = prime[1] = false;
  
  for(ull i=2 ; i*i<MAX ; i++){
    if(prime[i]){
      for(ull j=i*i ; j<MAX ; j+=i){
	prime[j] = false;
      }
    }
  }
}
  bool isPrime(ull a) { for(ull i=2; i*i <=a; i++) if(a%i == 0) return false; return true; }

int main() {

  sieve();
  ull N; cin >> N;
  
  if(N == 1) { cout << "NO\n"; return 0; }
  
  int cnt = 0;
  ull K = N;
  for(ull i=2; i*i<=K; i++) {
    if(prime[i]) {
      while(N % i == 0) {
	N /= i;
	cnt ++;
      }
    }
  }
  
  if(N > 1) {
    cnt ++;
  }
  
  if(cnt > 2) cout << "YES\n";
  else cout << "NO\n";
  
  return 0;
}