#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define all(x) (x).begin(),(x).end() #define rep(i,m,n) for(int i = m;i < n;++i) #define pb push_back #define fore(i,a) for(auto &i:a) #define rrep(i,m,n) for(int i = m;i >= n;--i) #define INF INT_MAX/2 using namespace std; using ll = long long; using R = double; const ll MOD = 1e9 + 7; const ll inf = 1LL << 50; struct edge { ll from; ll to; ll cost; }; ll n; vectordev; bool prime(ll n) { if (n == 1) { return false; } for (int i = 2; i*i <= n; i++) { if (n%i == 0) { return false; } } return true; } void devisor(ll n) { for (ll i = 1; i*i <= n; i++) { if (n%i == 0) { if (i == n / i) { dev.push_back(i); } else { dev.push_back(i); dev.push_back(n / i); } } } } int main(){ cin >> n; devisor(n); int ok = 0; rep(i, 0, dev.size()) { if (dev[i] != n && dev[i] != 1 && !prime(dev[i])) { ok = 1; break; } } if (ok)cout << "YES" << endl; else cout << "NO" << endl; return 0; }