#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;

#define rep(i, r) for(int i = 0; i < (r); ++i)
#define reps(i, s, r) for(int i = (s); i < (r); ++i)
#define fore(i, m2) for(auto &i : m2)
#define vi vector<int>
#define vl vector<ll>
#define pl pair<ll, ll>
#define all(i) (i).begin(), (i).end()
#define fs first
#define sc second

template <class T> bool chmin(T &i, T b) {
    if(i > b) {
        i = b;
        return true;
    }
    return false;
}
template <class T> bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

const ll INF = LONG_LONG_MAX / 3;
const ll MOD = 1'000'000'007;
const ll MAX = 1e6 + 5;

vector<pair<ll, ll>> prmFact(ll n) {
    vector<pair<ll, ll>> ret;
    for(ll i = 2; i * i <= n; i++) {
        if(n % i != 0)
            continue;
        ll tmp = 0;
        while(n % i == 0) {
            tmp++;
            n /= i;
        }
        ret.push_back(make_pair(i, tmp));
    }
    if(n != 1)
        ret.push_back(make_pair(n, 1));
    return ret;
}

int main() {

    ll n;
    cin >> n;

    auto pp = prmFact(n);
    ll cnt = 0;
    fore(v, pp) { cnt += v.sc; }

    if(cnt <= 2) {
        puts("NO");
    } else {
        puts("YES");
    }
}