#include using namespace std; #define MOD 1000000007 #define INF 100000000 #define MAX 100001 //#define int ll #define ll long long #define ld long double #define vi vector #define pa pair #define pb push_back #define mp make_pair #define INIT ios::sync_with_stdio(false);cin.tie(0); #define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__); template void MACRO_VAR_Scan(T& t) { cin >> t; } templatevoid MACRO_VAR_Scan(First& first, Rest&...rest) { cin >> first; MACRO_VAR_Scan(rest...); } #define VEC(type, c, n) vector c(n);for(auto& i:c)cin>>i; #define MAT(type, c, m, n) vector> c(m, vector(n));for(auto& r:c)for(auto& i:r)cin>>i; #define BR cout << "\n"; #define SP cout << " "; #define ENDL cout<=0;--i) #define FOR(i, m, n) for(int i = m;i < n; i++) #define RFOR(i, a, b) for(int i=(a)-1;i>=(b);--i) #define AREP(a, n) for(auto (a):(n)) #define ALL(a) (a).begin(),(a).end() #define IN(n, a, b) ((a)<=(n)&&(n)<(b)) ll p[10000001] = {}; signed main(){ INIT; VAR(ll, n); if(n < 3){ NO; RET; } p[0] = p[1] = 1; ll i = 2; while(i < sqrt(n)+2){ for(ll k = i * 2; k < sqrt(n)+2; k += i) p[k] = 1; i++; while(i < sqrt(n)+2 && p[i]) i++; } FOR(i, 2, sqrt(n)+1) if(!(n%i) && p[i]){ YES; RET; } NO; RET;}