#include using namespace std; using ll=long long int; //using Int=__int128; #define ALL(A) A.begin(),A.end() template bool chmin(T1 &a,T2 b){if(a<=b)return 0; a=b; return 1;} template bool chmax(T1 &a,T2 b){if(a>=b)return 0; a=b; return 1;} template constexpr int bitUP(T x,int a){return (x>>a)&1;} //→ ↓ ← ↑ int dh[4]={0,1,0,-1}, dw[4]={1,0,-1,0}; //右上から時計回り //int dh[8]={-1,0,1,1,1,0,-1,-1}, dw[8]={1,1,1,0,-1,-1,-1,0}; long double EPS = 1e-6; long double PI = acos(-1); const ll INF=(1LL<<62); const int MAX=(1<<30); constexpr ll MOD=1000000000+7; //constexpr ll MOD=998244353; inline void bin101(){ ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20); } using pii=pair; using pil=pair; using pli=pair; using pll=pair; using psi=pair; using pis=pair; using psl=pair; using pls=pair; using pss=pair; using Graph=vector>; template struct edge { int to; T cost; edge()=default; edge(int to, T cost) : to(to), cost(cost) {} }; template using WeightGraph=vector>>; //0-indexed vector cin template inline istream &operator>>(istream &is,vector &v) { for(size_t i=0;i>v[i]; return is; } //0-indexed vector cin template inline istream &operator>>(istream &is,vector> &v) { for(size_t i=0;i>v[i]; } return is; } //vector cout template inline ostream &operator<<(ostream &os,const vector &v) { for(size_t i=0;i cout template inline ostream &operator<<(ostream &os,const vector> &v) { for(size_t i=0;i inline ostream &operator<<(ostream &os,const Graph &g) { for(size_t i=0;i"< inline ostream &operator<<(ostream &os,const WeightGraph &g) { for(size_t i=0;i"< inline vector vmake(size_t n,T x){ return vector(n,x); } //a,b,c,x data[a][b][c] 初期値x template auto vmake(size_t n,Args... args){ auto v=vmake(args...); return vector(n,move(v)); } //pair cout template inline ostream &operator<<(ostream &os,const pair &p) { os< inline istream &operator>>(istream &is,pair &p) { is>>p.first>>p.second; return is; } //ソート template inline void vsort(vector &v){ sort(v.begin(),v.end()); } //逆順ソート template inline void rvsort(vector &v){ sort(v.rbegin(),v.rend()); } //1ビットの数を返す inline int popcount(int x){ return __builtin_popcount(x); } //1ビットの数を返す inline int popcount(ll x){ return __builtin_popcountll(x); } template inline void Compress(vector &C){ sort(C.begin(),C.end()); C.erase(unique(C.begin(),C.end()),C.end()); } template inline int lower_idx(const vector &C,T value){ return lower_bound(C.begin(),C.end(),value)-C.begin(); } template inline int upper_idx(const vector &C,T value){ return upper_bound(C.begin(),C.end(),value)-C.begin(); } //時計回りに90度回転 template inline void rotate90(vector> &C){ vector> D(C[0].size(),vector(C.size())); for(int h=0;h,vector>> GraphDecomposition(const Graph &g){ vector> id(g.size(),pair(-1,-1)); vector ret; vector now; for(size_t i=0;i T max(){ return numeric_limits::max(); } template T ADD(T a,T b){ T res; return __builtin_add_overflow(a,b,&res)?max():res; } template T MUL(T a,T b){ T res; return __builtin_mul_overflow(a,b,&res)?max():res; } }; //using namespace overflow; void solve(){ int N; cin>>N; if(N==1 or N==2){ cout<<1< v; v.emplace_back(3); v.emplace_back(6); for(int i=1;i<=(N+1)/2-1;i++){ if(i==3) continue; v.push_back(i*2); } cout<>T; while(T--) solve(); }