#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std; // NOLINT

int main() {
    int64_t n;
    cin >> n;
    if (n == 1) {
        cout << "NO" << endl;
        return 0;
    }
    vector<bool> ps(sqrt(n) + 2, true);
    for (auto i = 2; size_t(i) < ps.size(); ++i) {
        if (!ps[i])
            continue;
        for (auto j = i * 2; size_t(j) < ps.size(); j += i) {
            ps[i] = false;
        }
    }
    bool div = false;
    for (auto i = 2; size_t(i) < ps.size(); ++i) {
        if (!ps[i] && n % i == 0)
            div = true;
    }
    cout << (div ? "YES" : "NO") << endl;
    return 0;
}