#include #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,fma,abm,mmx,avx,avx2") #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--) #define all(x) (x).begin(), (x).end() #define sz(x) int(x.size()) #define yn(joken) cout<<((joken) ? "Yes" : "No")<<"\n" #define YN(joken) cout<<((joken) ? "YES" : "NO")<<"\n" using namespace std; using ll = long long; using vi = vector; using vl = vector; using vs = vector; using vc = vector; using vd = vector; using vld = vector; using vvi = vector>; using vvl = vector>; using vvs = vector>; using vvc = vector>; using vvd = vector>; using vvld = vector>; using vvvi = vector>>; using vvvl = vector>>; using vvvvi = vector>>>; using vvvvl = vector>>>; using pii = pair; using pll = pair; const int INF = 1e9; const ll LINF = 2e18; template bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; } template bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; } bool ispow2(int i) { return i && (i & -i) == i; } bool ispow2(ll i) { return i && (i & -i) == i; } template vector make_vec(size_t a) { return vector(a); } template auto make_vec(size_t a, Ts... ts) { return vector(ts...))>(a, make_vec(ts...)); } template istream& operator>>(istream& is, vector& v) { for (int i = 0; i < int(v.size()); i++) { is >> v[i]; } return is; } template ostream& operator<<(ostream& os, const vector& v) { for (int i = 0; i < int(v.size()); i++) { os << v[i]; if (i < int(v.size()) - 1) os << ' '; } return os; } static uint32_t RandXor(){ static uint32_t x=123456789; static uint32_t y=362436069; static uint32_t z=521288629; static uint32_t w=88675123; uint32_t t; t=x^(x<<11); x=y; y=z; z=w; return w=(w^(w>>19))^(t^(t>>8)); } static double Rand01(){ return (RandXor()+0.5)*(1.0/UINT_MAX); } // sieve SE(N): 1からNまでのmin_factor tableを作成 // vector factorize(int n): nを素因数分解した結果を(p,e)のvectorで返す // vi divisors(int n): nの正の約数を返す, 約数の個数をdとしてO(d) // int number_of_divisors(int n): nの正の約数の個数を返す, まあ一応書いただけ struct sieve{ vector is_prime; vector min_factor,primes; sieve(int N): is_prime(N+1,true),min_factor(N+1,-1){ is_prime[1]=false; min_factor[1]=1; for(int i=2;i<=N;i++){ if(!is_prime[i]) continue; primes.push_back(i); min_factor[i]=i; for(int j=i;j<=N;j+=i){ if(j!=i) is_prime[j]=false; if(min_factor[j]==-1) min_factor[j]=i; } } } vector> factorize(int n){ vector> ret; while(n>1){ int p=min_factor[n]; int e=0; while(n%p==0){ e++; n/=p; } ret.emplace_back(p,e); } return ret; } vector divisors(int n){ vector ret={1}; for(auto [p,e]:factorize(n)){ int cnt=int(ret.size()); for(int i=0;i>N; if(N==1){ cout<<"NO"<=3); } else if(sz(V)==2){ YN(max(V[0],V[1])>=2); } else{ cout<<"YES"<