#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> Q;

const int inf = (int)1e9; 

ll gcd(ll a, ll b) {
	if (b > a) {
		ll tmp = b;
		b = a;
		a = tmp;
	}
	if (a%b == 0)return b;
	else return gcd(b, a%b);
}


int main(void){
	ll n;
	cin>>n;
	if(n==1){
		cout<<"NO"<<endl;
		return 0;
	}
	ll t = n;
	map<ll,ll>p;
	for(ll i=2;i*i<=n;i++){
		if(t%i==0){
			while(t%i==0){
				t/=i;
				p[i]++;
			}
		}
	}
	if(t>1)p[t]++;
	if(p.size()==1)cout<<"NO"<<endl;
	else{
		if(p.size()==2)cout<<"NO"<<endl;
		else{
			cout<<"YES"<<endl;
		}
	}
}