#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2")
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define yn(joken) cout<<((joken) ? "Yes" : "No")<<"\n"
#define YN(joken) cout<<((joken) ? "YES" : "NO")<<"\n"
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vd = vector<double>;
using vld = vector<long double>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vvs = vector<vector<string>>;
using vvc = vector<vector<char>>;
using vvd = vector<vector<double>>;
using vvld = vector<vector<long double>>;
using vvvi = vector<vector<vector<int>>>;
using vvvl = vector<vector<vector<ll>>>;
using vvvvi = vector<vector<vector<vector<int>>>>;
using vvvvl = vector<vector<vector<vector<ll>>>>;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
const int INF = 1e9;
const ll LINF = 2e18;
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T& a, const T& b) {
    if (b < a) {
        a = b;
        return 1;
    }
    return 0;
}
bool ispow2(int i) { return i && (i & -i) == i; }
bool ispow2(ll i) { return i && (i & -i) == i; }
template <class T>
vector<T> make_vec(size_t a) {
    return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
    for (int i = 0; i < int(v.size()); i++) {
        is >> v[i];
    }
    return is;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < int(v.size()); i++) {
        os << v[i];
        if (i < int(v.size()) - 1) os << ' ';
    }
    return os;
}

static uint32_t RandXor(){
    static uint32_t x=123456789;
    static uint32_t y=362436069;
    static uint32_t z=521288629;
    static uint32_t w=88675123;
    uint32_t t;
 
    t=x^(x<<11);
    x=y; y=z; z=w;
    return w=(w^(w>>19))^(t^(t>>8));
}

static double Rand01(){
    return (RandXor()+0.5)*(1.0/UINT_MAX);
}

// sieve SE(N): 1からNまでのmin_factor tableを作成
// vector<pii> factorize(int n): nを素因数分解した結果を(p,e)のvectorで返す
// vi divisors(int n): nの正の約数を返す, 約数の個数をdとしてO(d)
// int number_of_divisors(int n): nの正の約数の個数を返す, まあ一応書いただけ

struct sieve{
    vector<bool> is_prime;
    vector<int> min_factor,primes;

    sieve(int N): is_prime(N+1,true),min_factor(N+1,-1){
        is_prime[1]=false;
        min_factor[1]=1;
        for(int i=2;i<=N;i++){
            if(!is_prime[i]) continue;
            primes.push_back(i);
            min_factor[i]=i;
            for(int j=i;j<=N;j+=i){
                if(j!=i) is_prime[j]=false;
                if(min_factor[j]==-1) min_factor[j]=i;
            }
        }
    }

    vector<pair<int,int>> factorize(int n){
        vector<pair<int,int>> ret;
        while(n>1){
            int p=min_factor[n];
            int e=0;
            while(n%p==0){
                e++;
                n/=p;
            }
            ret.emplace_back(p,e);
        }
        return ret;
    }

    vector<int> divisors(int n){
        vector<int> ret={1};
        for(auto [p,e]:factorize(n)){
            int cnt=int(ret.size());
            for(int i=0;i<cnt*e;i++) ret.emplace_back(ret[i]*p);
        }
        sort(ret.begin(),ret.end());
        return ret;
    }

    int number_of_divisors(int n){
        int ret=1;
        for(auto [p,e]:factorize(n)){
            ret*=e+1;
        }
        return ret;
    }
};

void solve(){
    ll N;
    cin>>N;
    if(N==1){
        cout<<"NO"<<endl;
        return;
    }
    sieve SE(20000000);
    auto P=SE.primes;
    vi V;
    for(auto p:P){
        if(N%p) continue;
        int e=0;
        while(N%p==0){
            e++;
            N/=p;
        }
        V.emplace_back(e);
    }
    if(N>1) V.emplace_back(1);
    if(sz(V)==1){
        YN(V[0]>=3);
    }
    else if(sz(V)==2){
        YN(max(V[0],V[1])>=2);
    }
    else{
        cout<<"YES"<<endl;
    }
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    solve();
}