#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <string>
#include <set>

using namespace std;
typedef long long ll;

set<ll> divisor(ll n) {
    set<ll> res;
    for (ll i = 1; i*i <= n; ++i) {
        if (n%i == 0) {
            res.insert(i);
            if (i != n / i) res.insert(n / i);
        }
    }
    return res;
}

bool is_prime(ll x) {
    for (ll i = 2; i*i <= x; ++i) {
        if (x%i == 0) return false;
    }
    return true;
}

bool is_ok(ll x) {
    if (x <= 2) return false;
    if (is_prime(x)) return false;
    set<ll> divs = divisor(x);
    if (divs.size() == 1)
        return false;
    else
        return true;
}

int main(void) {
    ll x;
    cin >> x;
    cout << (is_ok(x) ? "YES" : "NO") << endl;

    return 0;
}