#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, cnt = 0;
    cin >> n;
    tmp = 10000000;
    vector<ll> prime(tmp, 1);
    set<ll> fac;
    prime[0] = 0;
    for (int i = 2; i <= tmp; i++){
        if (prime[i]){
            if (!fac.count(i)){
                for (int j = i+i; j < tmp; j += i){
                    prime[j] = 0;
                }
            }
            if (!(n%i)){
                cnt++;
                n /= i;
                i--;
            }
            if (cnt >= 2){
                cout << "YES" << endl;
                return 0;
            }
        }
    }
    cout << "NO" << endl;
}