#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=1e6+5,M=1e7+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,A[N],B[N],ans[N],rt;
void init(){
	iota(B+1,B+n+1,1);
	shuffle(B+1,B+n+1,rnd);
	for(int i=1;i<=n;i++) gdb(B[i]);
}
int cts;
int qry(){
	cts++;
	cout<<"0 ";
	for(int i=1;i<=n;i++) cout<<A[i]<<' ';
	cerr<<endl;
	cout.flush();
	int x;cin>>x;
	// int x=0;for(int i=1;i<=n;i++) x+=(A[i]==B[i]);
	return x;
}
void calc(vector<int> id,vector<int> vs){
	gdb(id.size(),vs.size());
	if(id.size()==1){
		ans[id[0]]=vs[0];
		return;
	}
	int len=id.size()/2;
	vector<int> i1(id.begin(),id.begin()+len),i2(id.begin()+len,id.end());
	for(int i=1;i<=n;i++) A[i]=vs[0];
	
	vector<int> v1,v2;
	shuffle(all(vs),rnd);

	vector<int> st;
	
	for(int i=0;i<vs.size();i++){
		if(st.empty()){
			st.push_back(vs[i]);
			continue;
		}
		for(int j:i1) A[j]=st.front();
		for(int j:i2) A[j]=vs[i];
		int w=qry();
		if(w==2){
			for(int i:st) v1.push_back(i);st.clear();
			v2.push_back(vs[i]);
		}else if(w==0){
			v1.push_back(vs[i]);
			for(int i:st) v2.push_back(i);st.clear();
		}else{
			st.push_back(vs[i]);
		}
	}
	gdb(v1.size(),i1.size(),v2.size(),i2.size(),st.size());
	if(v1.size()!=i1.size()){
		for(int i:st) v1.push_back(i);
	}else{
		for(int i:st) v2.push_back(i);
	}
	calc(i1,v1);calc(i2,v2);
}
void Solve(){
	ios::sync_with_stdio(false);cin.tie(0);
	cin>>n;
	init();
	vector<int> id,vs;
	for(int i=1;i<=n;i++) id.push_back(i);
	for(int i=1;i<=n;i++) vs.push_back(i);
	calc(id,vs);
	cout<<"1 ";
	for(int i=1;i<=n;i++) cout<<ans[i]<<' ';cout<<endl;cout.flush();
	// for(int i=1;i<=n;i++) assert(ans[i]==B[i]);
	gdb(cts);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}