#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>

#define N 1000
#define MOD 1000000007
#define pe(str) return cout<<(str)<<endl,0
#define px(str) {cout<<(str)<<endl;exit(0);}
#define re(i,n) for(int i=0;i<(n);i++)
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define fe(i,n,f) for_each(i,n,f)
#define bw(a,b,c) (((a)<=(b))&&((b)<=(c)))
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int,int> pii;

bool isprime(ll x){
	if(x==1)return false;
	if(x==2)return true;
	for(ll i=2;i<=sqrt(x)+1;i++){
		if(x%i==0)return false;
	}
	return true;
}
int main(void){
	ll x;
	ll k=0;
	std::map<ll,ll> m;
	cin>>x;
	if(x==1)pe("NO");
	if(x==2)pe("NO");
	ll t=x;
	for(ll i=2;i<=sqrt(t)+1;i++){
		while(x%i==0){
			x/=i;
			k++;
			if(k==3)pe("YES");
		}
	}
pe("NO");
return 0;
}