#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define RALL(x) (x).rbegin(),(x).rend() #define ALL(x) (x).begin(),(x).end() #define repp(i,n) for(int (i)=1;(i)<=(n);(i)++) #define rep(i,n) for(int (i)=0;(i)<(n);(i)++) #define rev(i,n) for(int (i)=(n-1);(i)>=0;(i)--) #define clr(a) memset((a), 0 ,sizeof(a)) #define found(s,e) ((s).find(e)!=(s).end()) typedef pair P; typedef vector > pii; typedef map mdi; int isprime(long long n){ int ans=0; for(long long i = 2; i * i <= n; i++){ while(n % i == 0){ n/=i; ans++; } if(n!=1) ans++; } return ans; } int main(){ long long n; cin >> n; if(isprime(n)<3) cout << "NO" << endl; else cout << "YES" << endl; return 0; }