#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cmath>

#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
#define dump(val) cerr << __LINE__ << ":\t" << #val << " = " << (val) << endl

using namespace std;

typedef long long int lli;

template<typename T>
vector<T> make_v(size_t a, T b) {
    return vector<T>(a, b);
}

template<typename... Ts>
auto make_v(size_t a, Ts... ts) {
    return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}

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

    vector<bool> isPrime(static_cast<int>(sqrt(N)) + 2, true);
    isPrime[0] = isPrime[1] = false;
    vector<lli> Prime;
    for (lli i = 1; i * i <= N; i++) {
        if (isPrime[i]) {
            Prime.push_back(i);
            if (i * i == N) {
                cout << "NO" << endl;
                return 0;
            }
            for (lli j = i * 2; j * j <= N; j += i) {
                isPrime[j] = false;
            }
        }
    }

    int cnt = 1;
    lli n = N;
    REP(i, 0, Prime.size()) {
        while (n % Prime[i] == 0) {
            n /= Prime[i];
            cnt++;
        }
    }
    cout << (cnt >= 3 ? "YES" : "NO") << endl;
    return 0;
}