#include <bits/stdc++.h>
#define rep(i,n) for(int i=(0);i<(n);i++)

using namespace std;

typedef long long ll;

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);

	ll n;
	cin >> n;

	ll max_n = 10101010;
	vector<bool> isprime(max_n, true);
	isprime[0] = isprime[1] = false;
	set<ll> primes;
	for(int i = 2; i < max_n; i++){
		if(isprime[i]){
			primes.insert(i);
			for(int j = 2 * i; j < max_n; j += i) isprime[j] = false;
		}
	}

	for(int i = 2; i * i <= n; i++){
		if(n % i) continue;

		if(primes.count(i) == 0 || primes.count(n / i) == 0){
			cout << "YES" << endl;
			exit(0);
		}
	}

	cout << "NO" << endl;
}