#include <bits/stdc++.h>

using namespace std;

#define LL long long

LL isPrime(LL n) {
    if (n == 2 || n == 3) return 1;
    if (n == 0 || n == 1 || n % 2 == 0) return 0;
    for (int i = 3; i * i <= n; i += 2) {
        if (n % i == 0) return 0;
    }
    return 1;
}

int main() {
    LL n;
    cin >> n;
    if (isPrime(n) || n == 1) {
        cout << "NO" << endl;
    } else {
        cout << "YES" << endl;
    }
    return 0;
}