#include #include #define all(a) begin(a),end(a) #define fin(...) rr vo(pp(__VA_ARGS__)) #define ep(...) emplace(__VA_ARGS__) #define eb(...) emplace_back(__VA_ARGS__) #define ef(...) else if(__VA_ARGS__) #define el else #define wh(...) while(__VA_ARGS__) #define lb(...) lower_bound(__VA_ARGS__) #define ub(...) upper_bound(__VA_ARGS__) #define ov4(a,b,c,d,e,...) e #define ov5(a,b,c,d,e,f,...) f #define fo1(b) for(ll ii=0;ii<(ll)(b);++ii) #define fo2(i,b) for(ll i=0;i<(ll)(b);++i) #define fo3(i,a,b) for(ll i=(ll)(a);i<(ll)(b);++i) #define fo4(i,a,b,c) for(ll i=(ll)(a);i<(ll)(b);i+=(ll)(c)) #define fo(...) ov4(__VA_ARGS__,fo4,fo3,fo2,fo1)(__VA_ARGS__) #define of2(i,a) for(ll i=(ll)(a)-1;i>=0;--i) #define of3(i,a,b) for(ll i=(ll)(a)-1;i>=(ll)(b);--i) #define of4(i,a,b,c) for(ll i=(ll)(a)-1;i>=(ll)(b);i-=(ll)(c)) #define of(...) ov4(__VA_ARGS__,of4,of3,of2)(__VA_ARGS__) #define fe2(a,v) for(au&&a:v) #define fe3(a,b,v) for(au&&[a,b]:v) #define fe4(a,b,c,v) for(au&&[a,b,c]:v) #define fe5(a,b,c,d,v) for(au&&[a,b,c,d]:v) #define fe(...) ov5(__VA_ARGS__,fe5,fe4,fe3,fe2)(__VA_ARGS__) #define LL(...) ll __VA_ARGS__;li(__VA_ARGS__) #define DD(...) dd __VA_ARGS__;li(__VA_ARGS__) #define CH(...) char __VA_ARGS__;li(__VA_ARGS__) #define ST(...) str __VA_ARGS__;li(__VA_ARGS__) #define UL2(n,a) u1 a(n);li(a) #define UL3(n,a,b) u1 a(n),b(n);li(a,b) #define UL4(n,a,b,c) u1 a(n),b(n),c(n);li(a,b,c) #define UL5(n,a,b,c,d) u1 a(n),b(n),c(n),d(n);li(a,b,c,d) #define UL(...) ov5(__VA_ARGS__,UL5,UL4,UL3,UL2)(__VA_ARGS__) #define UV3(n,a,b) u1 a(n),b(n);vi(a,b) #define UV4(n,a,b,c) u1 a(n),b(n),c(n);vi(a,b,c) #define UV5(n,a,b,c,d) u1 a(n),b(n),c(n),d(n);vi(a,b,c,d) #define UV(...) ov5(__VA_ARGS__,UV5,UV4,UV3)(__VA_ARGS__) #define U2(h,w,a) u2 a(h,w);li(a) #define I template #define J typename #define O operator #define rr return #define uu using #define au auto #define cs const namespace atcoder{}namespace my{void main();void solve();}int main(){my::main();} namespace my{uu namespace std;uu namespace atcoder; uu is=istream;uu os=ostream;uu vo=void;uu bo=bool;uu dd=long double;uu u8=uint8_t; uu ll=long long;uu i64=ll;uu i128=__int128_t;uu ul=unsigned long long;uu u64=ul;uu u128=__uint128_t; uu ml=modint998244353; is&O>>(is&i,ml&x){ll t;i>>t;x=t;rr i;}os&O<<(os&o,cs ml&x){rr o<uu v1=vector; Istruct v2:v1>{uu v1>::v1;v2(ll a,ll b,T x=T{}){this->resize(a,v1(b,x));}}; Istruct v3:v1>{uu v1>::v1;v3(ll a,ll b,ll c,T x=T{}){this->resize(a,v2(b,c,x));}}; Istruct v4:v1>{uu v1>::v1;v4(ll a,ll b,ll c,ll d,T x=T{}){this->resize(a,v3(b,c,d,x));}}; Istruct v5:v1>{uu v1>::v1;v5(ll a,ll b,ll c,ll d,ll e,T x=T{}){this->resize(a,v4(b,c,d,e,x));}}; uu u1=v1;uu u2=v2;uu u3=v3;uu u4=v4;uu m1=v1;uu m2=v2;uu m3=v3;uu m4=v4;uu m5=v5; uu str=string;uu strs=v1;str sp=" ",nc="",nl="\n";str Yes(bo y=1){rr y?"Yes":"No";}str No(){rr Yes(0);} Istruct cp{ A a;B b;cp():a(A{}),b(B{}){}cp(A a,B b):a(a),b(b){}cp(pairp):a(p.first),b(p.second){} cp&O+=(cs cp&c){a+=c.a,b+=c.b;rr*this;}cp O+(cs cp&c)cs{rr cp{*this}+=c;} cp&O-=(cs cp&c){a-=c.a,b-=c.b;rr*this;}cp O-(cs cp&c)cs{rr cp{*this}-=c;}cp O-()cs{rr cp(-a,-b);} Icp&O+=(cs T&x){a+=x,b+=x;rr*this;}Icp O+(cs T&x)cs{rr cp{*this}+=x;} Icp&O-=(cs T&x){a-=x;b-=x;rr*this;}Icp O-(cs T&x)cs{rr cp{*this}-=x;} Icp&O*=(cs T&x){a*=x;b*=x;rr*this;}Icp O*(cs T&x)cs{rr cp{*this}*=x;} au abs()cs{rr std::abs(a)+std::abs(b);}au abs(cs cp&c)cs{rr(*this-c).abs();} bo O==(cs cp&c)cs{rr a==c.a&&b==c.b;}bo O!=(cs cp&c)cs{rr!(*this==c);} bo O<(cs cp&c)cs{rr a!=c.a?a=(cs cp&c)cs{rr!(*this(cs cp&c)cs{rr a!=c.a?a>c.a:b>c.b;}bo O<=(cs cp&c)cs{rr!(*this>c);} friend is&O>>(is&i,cp&c){rr i>>c.a>>c.b;}friend os&O<<(os&o,cs cp&c){rr o<;uu cls=v1; Istruct tr{ A a;B b;C c;tr():a(A{}),b(B{}),c(C{}){}tr(A a,B b,C c):a(a),b(b),c(c){} bo O==(cs tr&t)cs{rr a==t.a&&b==t.b&&c==t.c;} bo O<(cs tr&t)cs{rr a!=t.a?a(cs tr&t)cs{rr a!=t.a?a>t.a:b!=t.b?b>t.b:c>t.c;} friend is&O>>(is&i,tr&t){rr i>>t.a>>t.b>>t.c;}friend os&O<<(os&o,cs tr&t){rr o<;uu tls=v1; Istruct qu{ A a;B b;C c;D d;qu():a(A{}),b(B{}),c(C{}),d(D{}){}qu(A a,B b,C c,D d):a(a),b(b),c(c),d(d){} bo O==(cs qu&q)cs{rr a==q.a&&b==q.b&&c==q.c&&d==q.d;} bo O<(cs qu&q)cs{rr a!=q.a?a(cs qu&q)cs{rr a!=q.a?a>q.a:b!=q.b?b>q.b:c!=q.c?c>q.c:d>q.d;} friend os&O<<(os&o,cs qu&q){rr o<;uu qls=v1; Istruct set:std::set{set(){}set(cs v1&a){fe(e,a)this->ep(e);}}; Istruct uset:unordered_set{uset(){}uset(cs v1&a){fe(e,a)this->ep(e);}}; Istruct mset:multiset{mset(){}mset(cs v1&a){fe(e,a)this->ep(e);}bo erase(cs T&x){bo c=this->count(x);if(c)multiset::erase(this->find(x));rr c;}}; uu mp=map;Iuu umap=unordered_map;uu ump=umap;uu sl=set;uu usl=uset;uu msl=mset; Iuu qmax=priority_queue;Iuu qmin=priority_queue,greater>;uu dl=deque;Iuu fn=function; ll oo=3e18;dd ee=1e-12,pi=acosl(-1);u1 dx{-1,0,1,0,-1,1,1,-1},dy{0,-1,0,1,-1,-1,1,1}; bo odd(ll x){rr x&1;}bo eve(ll x){rr !odd(x);}ll pm1(ll x){rr 1-2*(x&1);}ll pw2(ll n){rr 1LL<T sq(cs T&a){rr a*a;} ll cbr(ll x){if(x<=1)rr x;ll r=cbrtl(x)-1;wh(r+1<=x/(r+1)/(r+1))++r;rr r;}IT cb(cs T&a){rr a*a*a;} ll msb(ll x){rr x?63-__builtin_clzll(x):-1;}ll lsb(ll x){rr x?__builtin_ctzll(x):-1;} ll l2(i128 x){x|=1;ll r=0;wh(x)x>>=1,++r;rr r;}ll l10(i128 x){x|=1;ll r=0;wh(x)x/=10,++r;rr r;} u1 io(ll n,ll x=0){u1 a(n);fo(i,n)a[i]=i+x;rr a;} Iau sum(T a,U d,V n){rr n*(a*2+(n-1)*d)/2;} Ill len(cs T&a){rr a.size();}Ibo mu(cs T&a){rr !len(a);} Ibo at(T S,ll i){rr S>>i&1;}IT at(cs v1&v,ll i){ll n=len(v);rr v[(i%n+n)%n];} Ill sgn(cs T&a){rr(a>ee)-(a<-ee);}Ill sgn(cs T&a,cs U&b){rr sgn(a-b);} IT cei(T x,U y){assert(y);rr(y<0?cei(-x,-y):(x>0?(x+y-1)/y:x/y));} IT flo(T x,U y){assert(y);rr(y<0?flo(-x,-y):(x>0?x/y:x/y-(x%y!=0)));} IT rect(cs v1&s,ll l,ll r){assert(0<=l&&l<=r&&r<=len(s));T t{};if(r)t+=s[r-1];if(l)t-=s[l-1];rr t;} Iau srt(v1&a){sort(all(a));rr a;}Iau rv(v1&a){reverse(all(a));rr a;} Iau rsr(v1&a){srt(a),rv(a);rr a;}Iau uq(v1&a){srt(a),a.erase(unique(all(a)),end(a));rr a;} Iau slice(cs v1&a,ll l,ll r){rr v1(begin(a)+l,begin(a)+r);} Ivo af(v1&v,U e=U{}){v.ep(begin(v),e);}Ivo df(v1&v){v.erase(begin(v));} Idecltype(au)bg(T&a){rr*begin(a);}Idecltype(au)rb(T&a){rr*rbegin(a);} IT pop(v1&v){T r=rb(v);v.pop_back();rr r;} IT pop(qmax&q){T r=q.top();q.pop();rr r;}IT pop(qmin&q){T r=q.top();q.pop();rr r;} IT pof(deque&q){T r=bg(q);q.pop_front();rr r;}IT pob(deque&q){T r=rb(q);q.pop_back();rr r;} Iau&O^=(v1&v,cs v1u){copy(all(u),back_inserter(v));rr v;}Iau O^(v1v,cs v1&u){rr v^=u;} Iau&O+=(v1&v,cs v1&u){fo(i,len(v))v[i]+=u[i];rr v;}Iau O+(v1v,cs v1&u){rr v+=u;} Iau&O-=(v1&v,cs v1&u){fo(i,len(v))v[i]-=u[i];rr v;}Iau O-(v1v,cs v1&u){rr v-=u;} Iau&O++(v1&v){fe(e,v)++e;rr v;}Iau O++(v1&v,int){au r=v;++v;rr r;} Iau&O--(v1&v){fe(e,v)--e;rr v;}Iau O--(v1&v,int){au r=v;--v;rr r;}Iau O-(v1v){fe(e,v)e*=-1;rr v;} Iau&O+=(v1&v,cs U a){fe(e,v)e+=a;rr v;}Iau O+(v1v,cs U&a){rr v+=a;} Iau&O-=(v1&v,cs U a){fe(e,v)e-=a;rr v;}Iau O-(v1v,cs U&a){rr v-=a;} Iau&O*=(v1&v,cs U a){fe(e,v)e*=a;rr v;}Iau O*(v1v,cs U&a){rr v*=a;} Iau&O/=(v1&v,cs U a){fe(e,v)e/=a;rr v;}Iau O/(v1v,cs U&a){rr v/=a;} Ibo amax(T&a,cs U&b){rr aau max(T...a){rr max(initializer_list>{a...});} Ibo amin(T&a,cs U&b){rr a>b?a=b,1:0;}Iau min(T...a){rr min(initializer_list>{a...});} IT max(cs v1&a){rr*max_element(all(a));}Iau max(cs v2&a){rr max(*max_element(all(a)));} IT min(cs v1&a){rr*min_element(all(a));}Iau min(cs v2&a){rr min(*min_element(all(a)));} IT sum(cs v1&a){rr accumulate(all(a),T{});}IT sum(cs v2&a){T r{};fe(e,a)r+=sum(e);rr r;} Ill lbs(cs v1&a,cs U&b){rr lb(all(a),b)-begin(a);}Ill ubs(cs v1&a,cs U&b){rr ub(all(a),b)-begin(a);} struct fio{fio(){cin.tie(0);ios::sync_with_stdio(0);cout<os&O<<(os&o,cs pair&p){rr o<os&O<<(os&o,qmaxq){wh(len(q))o<os&O<<(os&o,cs map&m){fe(p,m)o<os&O<<(os&o,qminq){wh(len(q))o<os&O<<(os&o,cs umap&m){fe(p,m)o<os&O<<(os&o,cs v1&v){fe(e,v)o<is&O>>(is&i,v1&v){fe(e,v)i>>e;rr i;} Ios&O<<(os&o,cs v2&v){fe(e,v)o<ll pp(cs T&a,cs A&...b){cout<ll li(T&...a){(cin>>...>>a);rr 0;} Ivo vi(ll i,T&...a){(cin>>...>>a[i]);}Ivo vi(v1&a,A&...b){fo(i,len(a))vi(i,a,b...);} struct edg{ll t,w;edg(){}edg(ll t,ll w=1):t(t),w(w){}};uu graph=v2; u2 tou(cs graph&g){ll n=len(g);u2 a(n);fo(u,n)fe(v,w,g[u])a[u].eb(v);rr a;} graph tog(cs u2&a){ll n=len(a);graph g(n);fo(u,n)fe(v,a[u])g[u].eb(v);rr g;} au mgi(u2&g,ll m){UV(m,a,b);--a,--b;fo(i,m)g[a[i]].eb(b[i]),g[b[i]].eb(a[i]);rr tuple(a,b);} au ygi(u2&g,ll m){UV(m,a,b);--a,--b;fo(i,m)g[a[i]].eb(b[i]);rr tuple(a,b);} au mgi(graph&g,ll m){UV(m,a,b,c);--a,--b;fo(i,m)g[a[i]].eb(b[i],c[i]),g[b[i]].eb(a[i],c[i]);rr tuple(a,b,c);} au ygi(graph&g,ll m){UV(m,a,b,c);--a,--b;fo(i,m)g[a[i]].eb(b[i],c[i]);rr tuple(a,b,c);} au ti(u2&g){rr mgi(g,len(g)-1);}au ti(graph&g){rr mgi(g,len(g)-1);} au de(cs u1&a,cs char&b='a'){str r{};fe(e,a)r+=e+b;rr r;} au de(cs u2&a,cs char&b='a'){ll n=len(a);strs r(n);fo(i,n)r[i]=de(a[i],b);rr r;} au de(cs u1&a,cs str&b){ll n=len(a);str r(n,'$');fo(i,n)fo(j,len(b))if(a[i]==j){r[i]=b[j];break;}rr r;} au de(cs u2&a,cs str&b){ll n=len(a);strs r(n);fo(i,n)r[i]=de(a[i],b);rr r;} u1 en(cs str&s,cs char&b='a'){u1 r;fe(c,s)r.eb(c-b);rr r;} u2 en(cs strs&s,cs char&b='a'){u2 r;fe(e,s)r.eb(en(e,b));rr r;} u1 en(cs str&s,cs str&b){ll n=len(s);u1 r(n,-1);fo(i,n)fo(j,len(b))if(s[i]==b[j]){r[i]=j;break;}rr r;} u2 en(cs strs&s,cs str&b){u2 r;fe(e,s)r.eb(en(e,b));rr r;} str ins(){str s;li(s);rr s;}strs ins2(ll n){strs s(n);li(s);rr s;}u1 abc(){rr en(ins());}u2 abcs(ll n){rr en(ins2(n));} Istruct rec:F{rec(F&&f):F(std::forward(f)){}Idecltype(au)O()(T&&...a)cs{rr F::O()(*this,std::forward(a)...);}}; Iau tzp(A&...a){v1v;fe(e,{a...})v^=e;uq(v);rr v;} vo pz(cs u1&v,u1&h){fe(e,h)e=lbs(v,e);}Ivo pz(cs u1&v,u1&h,T&...t){pz(v,h);pz(v,t...);} Iu1 zp(T&...a){u1 v=tzp(a...);pz(v,a...);rr v;}u1 zp(u2&a){u1 v;fe(e,a)v^=e;uq(v);fe(e,a)fe(x,e)x=lbs(v,x);rr v;} Ivo sv(cs u1&o,v1&a){au c=a;fo(i,len(a))a[i]=c[o[i]];}Ivo sv(cs u1&o,v1&a,A&...b){sv(o,a);sv(o,b...);} Iu1 vs(cs fn&f,v1&a){u1 o=io(len(a));sort(all(o),f);sv(o,a);rr o;} Iu1 vs(cs fn&f,v1&a,A&...b){u1 o=io(len(a));sort(all(o),f);sv(o,a);sv(o,b...);rr o;} ll bsl(cs fn&j,ll o,ll n){wh(abs(o-n)>1)(j((o+n)/2)?o:n)=(o+n)/2;rr o;} dd bsd(cs fn&j,dd o,dd n){wh(abs(o-n)>ee)(j((o+n)/2)?o:n)=(o+n)/2;rr o;} Iau zt(v1a){fo(i,1,len(a))a[i]+=a[i-1];rr a;}Iau zt(v2a){fe(v,a)v=zt(v);fo(i,1,len(a))a[i]+=a[i-1];rr a;} Iau mb(v1a){of(i,len(a),1)a[i]-=a[i-1];rr a;}Iau mb(v2a){fe(v,a)v=mb(v);of(i,len(a),1)a[i]-=a[i-1];rr a;} au rle(cs u1&a){cls r;fe(e,a)len(r)&&e==rb(r).a?++rb(r).b,0:(r.eb(e,1),0);rr r;} au rce(cs u1&a){cls r;ump m;fe(e,a)++m[e];fe(k,v,m)r.eb(k,v);rr uq(r),r;} u1 divs(ll n){u1 r;fo(i,1,n/i+1)if(n%i==0)r.eb(i),r.eb(n/i);rr uq(r),r;} mp fact(ll n){ump m;fo(i,2,n/i+1)wh(n%i==0)++m[i],n/=i;if(n>1)++m[n];rr mp(all(m));} i128 inv(i128 a,i128 m){a=(a%m+m)%m;i128 b=m,u=1,v=0;wh(b)u-=a/b*v,swap(u,v),a-=a/b*b,swap(a,b);rr(u%m+m)%m;} i128 pow(i128 x,i128 n){assert(n>=0);i128 r=1;wh(n){if(n&1)r*=x;x*=x,n>>=1;}rr r;} i128 pow(i128 x,i128 n,i128 m){if(n<0)n=-n,x=inv(x,m);i128 r=1;wh(n){if(n&1)r*=x,r%=m;x*=x,x%=m,n>>=1;}rr r;} //https://nyaannyaan.github.io/library/modint/modint-montgomery64.hpp struct montgomery64{ uu ml=montgomery64; static u64 m; static u64 minv;//m^{-1} static u64 n2;//n=2^64,n2=n^2%m static u64 get_minv(){ u64 r=m; fo(5)r*=2-m*r;//newton's method rr r; } static void set_mod(u64 m){ //assert(m<(1LL<<62)); assert(m&1); ml::m=m; n2=-u128(m)%m; minv=get_minv(); assert(m*minv==1); } static u64 mod(){ rr m; } u64 a; montgomery64():a(0){} montgomery64(cs i64&b):a(reduce((u128(b)+m)*n2)){}; static u64 reduce(cs u128&b){//montgomery reduction u128 r=(b+u128(u64(b)*-minv)*m)>>64; rr r>=m?r-m:r; } ml&O+=(cs ml&b){if(i64(a+=b.a-m*2)<0)a+=m*2;rr*this;} ml&O-=(cs ml&b){if(i64(a-=b.a)<0)a+=m*2;rr*this;} ml&O*=(cs ml&b){a=reduce(u128(a)*b.a);rr*this;} ml&O/=(cs ml&b){*this*=b.inv();rr*this;} ml O+(cs ml&b)cs{rr ml(*this)+=b;} ml O-(cs ml&b)cs{rr ml(*this)-=b;} ml O*(cs ml&b)cs{rr ml(*this)*=b;} ml O/(cs ml&b)cs{rr ml(*this)/=b;} bo O==(cs ml&b)cs{rr(a>=m?a-m:a)==(b.a>=m?b.a-m:b.a);} bo O!=(cs ml&b)cs{rr(a>=m?a-m:a)!=(b.a>=m?b.a-m:b.a);} ml O-()cs{rr ml()-ml(*this);} ml pow(u128 n)cs{ ml r(1),x(*this); wh(n){ if(n&1)r*=x; x*=x; n>>=1; } rr r; } ml inv()cs{ rr pow(m-2); } u64 val()cs{ u64 r=reduce(a); rr r>=m?r-m:r; } friend os&O<<(os&o,cs ml&b){ rr o<bo miller_rabin(ll n,u1 as){ ul t=0,d=n-1; wh(eve(d))d>>=1; if(ml::mod()!=n)ml::set_mod(n); fe(a,as){ if(a>=n)break; ul t=d; ml y=ml(a).pow(t); wh(t!=n-1&&y!=1&&y!=n-1)y*=y,t<<=1; if(y!=n-1&&eve(t))rr 0; } rr 1; } bo is_prime(ll n){//n<=10^{18} if(~n&1)rr n==2; if(n<=1)rr 0; rr miller_rabin(n,{2,3,5,7,11,13,17,19,23,29,31,37}); } vo main(){ll T=1;fo(T)solve();} vo solve(){ LL(Q); fo(Q){ LL(N); //pp(Yes(is_prime(N))); pp(N,is_prime(N)); } }}