#include using namespace std; using ll = long long; using vi = vector; using vb = vector; using vd = vector; using vl = vector; using vvi = vector; using vvb = vector; using vvd = vector; using vvl = vector; pair primeFactors(ll n){ vl p,e; ll m = n; for(ll i = 2; i*i <= n; i++){ if(m%i != 0) continue; int c = 0; while(m%i == 0) c++, m /= i; p.push_back(i); e.push_back(c); } if(m > 1){ p.push_back(m); e.push_back(1); } return make_pair(p,e); } int main() { ll n; cin >> n; auto v = primeFactors(n); ll sum = 0; for (auto& i : v.second) sum += i; cout << (sum > 2 ? "YES" : "NO") << endl; return 0; }