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