#include "bits/stdc++.h"
using namespace std;

typedef long long ll;

map<ll, ll> prime_factor(ll n) {
	map<ll, ll> res;
	for (ll i = 2; i*i <= n; i++) {
		while (n%i == 0) {
			++res[i];
			n /= i;
		}
	}
	if (n != 1) res[n] = 1;
	return res;
}



int main() {
	ll N;
	cin >> N;

	bool f=false;
	map<ll,ll> m;
	m = prime_factor(N);
	ll cnt=0;
	for (auto itr = m.begin(); itr != m.end(); itr++) {
		//cout << itr->first <<" "<< itr->second << endl;
		cnt += itr->second;
	}
	
	if(cnt>=3) cout << "YES" << endl;
	else cout << "NO" << endl;
}