#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,m,n) for(int i=m; i<n; ++i)
#define repl(i,m,n) for(ll i=m; i<n; ++i)

int main(){
    ll N;
    cin >> N;

    const ll LIM = 10000010;
    vector<bool> is_prime(LIM, true);
    is_prime[0] = is_prime[1] = false;

    for(ll i = 2LL; i <= LIM; ++i){
        if(!is_prime[i]) continue;
        for(ll j = 2*i; j <= LIM; j += i){
            is_prime[j] = false;
        } 
    }

    for(ll i = 2LL; i*i <= N; ++i){
        if(N % i == 0LL){
            ll j = N / i;
            if(!is_prime[i] || !is_prime[j]){
                cout << "YES" << endl;
                return 0;
            }
        }
    }
    cout << "NO" << endl;
    return 0;
}