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

int main()
{
	int64_t n;
	cin >> n;
	
	if(n == 1)
	{
		cout << "NO" << endl;
		return 0;
	}
	
	vector<bool> is_prime(10000001, true);
	for(int64_t i = 2; i <= 10000000; i++)
	{
		if(is_prime[i])
		{
			for(int64_t j = 2 * i; j <= 10000000; j += i)
			{
				is_prime[j] = false;
			}
		}
	}
	
	
	for(int64_t i = 2; i * i <= n; i++)
	{
		if(n % i == 0)
		{
			if(!is_prime[i])
			{
				cout << "YES" << endl;
				return 0;
			}
			if(n / i <= 10000000)
			{
				if(!is_prime[n / i])
				{
					cout << "YES" << endl;
					return 0;
				}
			}
		}
	}
	cout << "NO" << endl;
	return 0;
}