#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
typedef long long ll;

vector<int> fac(int n){
    vector<int> ans;
    for(int i = 2; i*i <= n; i++){
        while(n%i == 0){
            ans.push_back(i);
            n /= i;
        }
    }
    if(n != 1) ans.push_back(n);
    return ans;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int a; cin >> a;
    auto v = fac(a);
    if(a == 1){
        cout << "NO" << endl;
    }else if(v.size() == 1){
        cout << "NO" << endl;
    }else{
        set<int> st;
        for(int i : v) st.insert(i);
        if(v[0] == 2 && st.size() == 1){
            cout << "NO" << endl;
        }else{
            cout << "YES" << endl;
        }
    }
}