#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #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; bool isPrime(ll n) { if (n < 2) return false; for (int i = 2; i * i <= n; ++i) { if (n % i == 0) { return false; } } return true; } int main(int argc, char *argv[]) { ll N; cin >> N; cout << ((N == 1 || isPrime(N)) ? "NO" : "YES") << endl; return 0; }