#include<iostream>
#include<iomanip>
#include<string>
#include<algorithm>
#include<vector>
#include<set>
#include<list>
#include<queue>
#include<math.h>
#include<bitset>
using ll = long long;
using namespace std;

int main(){
    ll n, tmp;
    cin >> n;
    tmp = pow(n, 0.5);
    vector<ll> prime(tmp+1001, 1);
    prime[0] = 0;
    for (int i = 2; i < tmp+1001; i++){
        if (prime[i]){
            for (int j = i+i; j < tmp+1001; j += i) prime[j] = 0;
        } else if (!(n%i)){
                    cout << "YES" << endl;
                    return 0;
        }
    }
    cout << "NO" << endl;
}