#include <iostream>
#include <cmath>
using namespace std;

bool isPrime(long long int n){
	long long int m = sqrt(n) + 1;
	if(n==1)return false;
	if(n==2)return true;
	if(n%2==0)return false;
	for(long long int i=3;i<m;i+=2){
		if(n%i == 0)return false;
	}
	return true;
}

int main() {
	long long int n;
	long long int d;
	int count;
	cin>>n;
	
	d = 2;
	count = 0;
	while(n!=1){
		if(isPrime(n)){
			++count;
			break;
		}
		if(n%d == 0){
			n /= d;
			++count;
		}else{
			++d;
		}
	}
	cout << (count>=3?"YES":"NO") << endl;

	return 0;
}