#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <numeric>
#include <functional>
#include <set>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <climits>
#include <fstream>
#include <bitset>
#include <time.h>

#define ll long long
#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define RFOR(i,a) for(int i=(a); i >= 0; --i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define DUMP(x)  cerr << #x << " = " << (x) << endl;
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define EPS 1e-14

using namespace std;

/* nを素因数分解する(O(n^(1/2)))
primeFactorDecomposition(12) : {2:2, 3:1}
 */
map<ll, ll> primeFactorDecomposition(ll n) {
    map<ll, ll> m;
    while (n > 1) {
        bool findFactor = false;
        for (ll i = 2; i * i <= n; ++i) {
            if (n % i == 0) {
                m[i]++;
                n /= i;
                findFactor = true;
                break;
            }
        }
        if (!findFactor) {
            m[n]++;
            break;
        }
    }
    return m;
}

bool can_use(ll N) {
    map<ll, ll> m = primeFactorDecomposition(N);
    
    int n = 0;
    FOE(p, m) {
        n += p.second;
    }

    return n > 2;
}


int main(int argc, char *argv[]) {
    ll N;
    cin >> N;
    cout << (can_use(N) ? "YES" : "NO") << endl;

    return 0;
}