#include<algorithm>
#include<cmath>
#include<cstdio>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<string>
#include<utility>
#include<vector>

using namespace std;
typedef long long ll;
const ll mod = 1000000007;
#define rep(i,n) for(int i=0;i<n;i++)
#define repl(i,s,e) for(int i=s;i<e;i++)
#define reple(i,s,e) for(int i=s;i<=e;i++)
#define revrep(i,n) for(int i=n-1;i>=0;i--)
#define all(x) (x).begin(),(x).end()

int isprime(long long a) {
	int ans = 0;
	for (long long i = 2; i * i <= a; i++)
	{
		while (a % i == 0) {
			a /= i;
			ans++;
		}
	}
	if (a != 1) ans++;
	return ans;
}

int main() {
	long long N;
	cin >> N;
	if (isprime(N) < 3) cout << "NO" << endl;
	else cout << "YES" << endl;
}