#include <iostream>
#include <cmath>

using namespace std;

#define REP(i,first,last) for(int i=first;i<last;i++)

bool check(long n){
  long origin_n = n;
  int i = 2;
  int count = 0;
  while (n != 1 && i <= sqrt(origin_n)) {
    if (n % i == 0) {
      count++;
      if (count == 3) return true;
      n /= i;
    } else {
      i++;
    }
  }
  if (n != 1 && count == 2) {
    return true;
  } else {
    return false;
  }
}

int main(){
  long n;
  cin >> n;
  if (check(n)) {
    cout << "YES" << endl;
  } else {
    cout << "NO" << endl;
  }
}