#include <bits/stdc++.h>

#define show(x) cout << #x << " = " << x << endl

using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v)
{
    os << "sz=" << v.size() << "\n[";
    for (const auto& p : v) {
        os << p << ",";
    }
    os << "]\n";
    return os;
}

template <typename S, typename T>
ostream& operator<<(ostream& os, const pair<S, T>& p)
{
    os << "(" << p.first << "," << p.second
       << ")";
    return os;
}


constexpr ll MOD = 1e9 + 7;

template <typename T>
constexpr T INF = numeric_limits<T>::max() / 100;

constexpr ll MAX = 1e14;
constexpr ll SQRT = 1e7;
bool isprime[SQRT];
vector<ll> prime;

int main()
{
    ll N;
    cin >> N;
    for (ll i = 0; i < SQRT; i++) {
        isprime[i] = true;
    }
    for (ll i = 2; i < SQRT; i++) {
        if (isprime[i]) {
            for (ll j = 2; i * j <= SQRT; j++) {
                isprime[i * j] = false;
            }
        }
    }
    for (ll i = 2; i < SQRT; i++) {
        if (isprime[i]) {
            prime.push_back(i);
        }
    }

    int num = 0;
    for (const ll p : prime) {
        while (N % p == 0) {
            N /= p;
            num++;
        }
    }
    if (N > 1) {
        num++;
    }

    if (num > 2) {
        cout << "YES" << endl;
    } else {
        cout << "NO" << endl;
    }
    return 0;
}