#include <iostream>
#include <map>

using namespace std;

map<int64_t, int> prime_factor(int64_t n) {
    map<int64_t, int> ret;
    for (int64_t i = 2; i * i <= n; i++) {
        while (n % i == 0) {
            ret[i]++;
            n /= i;
        }
    }
    if (n != 1) ret[n] = 1;
    return ret;
}

int main() {
    long long n;
    cin >> n;

    auto ma = prime_factor(n);
    long long count = 0;
    for (auto x:ma)count += x.second;

    cout << (count > 2 ? "YES" : "NO") << endl;
    return 0;
}