#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cstring>

typedef long long ll;
using namespace std;

#define mod 1000003
#define INF 10000000
#define LLINF 2000000000000000000LL

#define SIZE 100000

vector<ll> factor(ll n){
    vector<ll> ret,ret2;
    
    for(ll i=1;i*i<=n;i++){
        if(n%i==0){
            ret.push_back(i);
            
            if(i*i<n)
                ret2.push_back(n/i);
        }
    }
    
    for(ll i=0;i<ret2.size();i++){
        ret.push_back(ret2[ret2.size()-1-i]);
    }
    
    return ret;
}

int main(){
    ll n;
    vector<ll> fac;
    
    cin >> n;
    
    fac = factor(n);
    
    for(int i=1;i<fac.size()-1;i++){
        bool f = false;
        
        for(ll j=2;j*j<=fac[i];j++){
            if(fac[i]%j==0)
                f = true;
        }
        
        if(f){
            puts("YES");
            return 0;
        }
    }
    
    puts("NO");
    return 0;
}