#include <iostream>
#include <string>
#include <unordered_map>
using namespace std;
typedef long long ll;

string func(ll n)
{
    if (n==1) return "NO";
    unordered_map<int, int> f;
    for(ll i=2;i*i<=n;++i) {
        int c=0;
        while (n%i==0) { c++; n/=i; }
        if (c) f[i]+=c;
    }
    if (n>1) f[n]++;
    int cnt=0;
    for(auto& v: f) cnt+=v.second;
    return cnt>2?"YES":"NO";
}
int main()
{
    ll n;
    while (cin>>n) cout<<func(n)<<endl;
}