#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, string> pls;

ll p[10000010];

int is_prime(ll n) {
	if (n == 1)return 0;
	if (n == 2)return 1;
	for (int i = 2; i <= sqrt(n); i++) {
		if (n % i == 0)
			return 0;
	}
	return 1;
}

int main()
{
	ll N,n;
	cin >> N; 
	n = N;

	if (N == 1) {
		cout << "NO" << endl;
		return 0;
	}

	ll w = 2, ans = 1;
	while (N != 1) {
		if (N % w == 0) {
			p[w]++;
			ans *= w;
			if (ans != n && !is_prime(ans)) {
				cout << "YES" << endl;
				return 0;
			}
			N /= w;
		}
		else {
			w++;
			if (w > sqrt(n))break;
		}
	}

	cout << "NO" << endl;
	return 0;
}