#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

bool p[10000001];

ll n;

void sieve()
{
    for (ll i = 2; i * i <= n; ++i) {
        if (p[i]) for (ll j = i + i; j * j <= n; j += i) p[j] = false;
    }
}

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

int main()
{
    cin >> n;

    memset(p, true, sizeof(p));
    sieve();

    if (n == 1 || is_prime(n)) {
        cout << "NO" << endl;
        return 0;
    }

    for (ll i = 2; i * i <= n; ++i) if ((!p[i] || !is_prime(n/i)) && n % i == 0) {
        cout << "YES" << endl;
        return 0;
    }

    cout << "NO" << endl;
}