#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = (ll)(1e+9) + 7;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
const int key = 10000001;
bool isp[key];
vector<ll> v;
void init() {
	fill(isp + 2, isp + key, true);
	Rep(i, 2, key) {
		if (!isp[i])continue;
		v.push_back(i);
		for (int j = 2*i; j < key; j += i) {
			isp[j] = false;
		}
	}
}
int main() {
	init();
	ll n; cin >> n;
	int len = v.size();
	int c = 0;
	rep(j, len) {
		while (n%v[j] == 0) {
			c++; n /= v[j];
		}
	}
	if (n > 1)c++;
	if (c > 2)cout << "YES" << endl;
	else cout << "NO" << endl;
	return 0;
}