#include <iostream>
#include <map>
using namespace std;

typedef long long ll;

map<ll, int> PrimeFactorization(ll number) {
    map<ll, int> res;
    for (ll n = 2; n * n <= number; n++) {
        while (number % n == 0) {
            res[n]++;
            number /= n;
        }
    }
    if (number != 1) res[number]++;
    return res;
}

int main() {
    ll N;
    cin >> N;

    map<ll, int> factors = PrimeFactorization(N);

    int divisor_num = 1, size;
    for (auto it = factors.begin(); it != factors.end(); it++) {
        divisor_num *= it->second + 1;
    }
    size = factors.size();

    if (divisor_num - size - 2 > 0) {
        cout << "YES" << endl;
    } else {
        cout << "NO" << endl;
    }

    return 0;
}