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

template <typename T> map<T, T> prime_factor(T n)
{
  map<T, T> ret;
  for(T i = 2; i * i <= n; i++)
  {
    T count = 0;
    while(n % i == 0)
    {
      count++;
      n /= i;
    }
    
    if(count > 0) ret[i] = count;
    if(n == 0) break;
  }
  
  if(n != 1) ret[n] = 1;
  return ret;
}

int main()
{
	int64_t n;
	cin >> n;
	if(n == 1)
	{
		cout << "NO" << endl;
		return 0;
	}
	
	map<int64_t, int64_t> mp = prime_factor(n);
	int64_t cnt = 0;
	for(auto v : mp) cnt += v.second;
	if(cnt >= 3) cout << "YES" << endl;
	else cout << "NO" << endl;
	return 0;
}