#include<bits/stdc++.h>
#define rep(i,a,n) for (int i = a; i < n; i++)
#define per(i,n,a) for (int i = n - 1; i >= a; i--)
using namespace std;

int isprime(long long a) {
    int ans = 0;
    for (long long i = 2; i * i <= a; i++) {
        while (a % i == 0) {
            a /= i;
            ans++;
        }
    }
    if (a != 1) ans++;
    return ans;
}

int main() {
    long long N;
    cin >> N;
    if (isprime(N) < 3) cout << "NO" << endl;
    else cout << "YES" << endl;
}