#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
const ll inf = (1 << 30) - 1;
const ll infll = (1LL << 61) - 1;

ll N;

template <typename T>
vector<T> prime_factor(T n)
{
    vector<T> res;
    for (T i = 2; i * i <= n; i++)
    {
        while (n % i == 0)
        {
            res.push_back(i);
            n /= i;
        }
    }
    if (n != 1)
        res.push_back(n); //nは素数
    return res;
}

int main()
{
    cin >> N;
    auto v = prime_factor(N);
    if (v.size() <= 2)
    {
        cout << "NO" << endl;
    }
    else
        cout << "YES" << endl;
}