// No.36 素数が嫌い！
#include <iostream>
#include <map>
using namespace std;
typedef long long ll;

int main() {
    ll N;
    cin >> N;
    map<int, int> mp;
    for (int i = 2; (ll)i * i <= N; ++i) {
        if (N % i) continue;
        while (N % i == 0) {
            N /= i;
            mp[i]++;
        }
    }
    if (N != 1) mp[N]++;
    bool judge = false;
    if (mp.size() > 2) judge = true;
    else if (mp.size() == 2){
        if (mp.begin()->second > 1 || mp.rbegin()->second > 1) judge = true;
    } else if (mp.size() == 1) {
        if (mp.begin()->second > 2) judge = true;
    }
    if (judge) cout << "YES" << endl;
    else cout << "NO" << endl;
}