#include<bits/stdc++.h>
#include"library.h"
#pragma GCC optimize("unroll-loops,no-stack-protector")
using namespace std;
typedef int ll;
typedef long double ld;
typedef pair<int,ll> pll;
const ll MOD=1e9+7;
const ll MOD2=998244353;
const ld pi=3.14159265359;
#define SQ(i) ((i)*(i))
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(_a) (ll)_a.size()
void Solve(int N){
if(N==1){
Answer(vector<int>(1,1));
return;
}
vector<ll> q(N),t(N),ans;
ll A,B;
REP(i,N)t[i]=i,q[i]=1;
REP(i,N){
q[i]=0;
if(Query(q)==1){
t.erase(t.begin()+i);
ans.pb(i);break;
}
q[i]=1;
}
REP(i,N)q[i]=0;
while(SZ(ans)<N){
ll l=-1,r=SZ(t)-1;
while(r-1>l){
ll mid=(l+r)/2;
for(int i=0;i<=mid;i++)q[t[i]]=1;
A=Query(q);
q[ans.back()]=1;
B=Query(q);
for(int i=0;i<=mid;i++)q[t[i]]=0;
q[ans.back()]=0;
if(A==B){
r=mid;
}else{
l=mid;
}
}
ans.pb(t[r]);
t.erase(t.begin()+r);
}
REP(i,N)ans[i]+=1;
Answer(ans);
}
