#include #define rep(i, a, n) for (int i = a; i < n; i++) #define repr(i, a, n) for (int i = n - 1; i >= a; i--) using namespace std; using ll = long long; using P = pair; template void chmin(T &a, T b) { a = min(a, b); } template void chmax(T &a, T b) { a = max(a, b); } bool is_prime(ll num) { if (num < 2) return false; else if (num == 2) return true; else if (num % 2 == 0) return false; double sqrt_num = sqrt(num); for (ll i = 3; i <= sqrt_num; i += 2) { if (num % i == 0) return false; } return true; } int main() { ios::sync_with_stdio(false); cin.tie(0); ll n; cin >> n; if (n == 1 || is_prime(n)) cout << "NO" << endl; else cout << "YES" << endl; }