#include<bits/stdc++.h>
//#define int long long
using namespace std;
int read()
{
	int x = 0, f = 1;
	char c = getchar();
	while(c != EOF and !isdigit(c))
	{
		if(c == '-')f = -1;
		c = getchar();
	}
	while(isdigit(c))
	{
		x = x * 10 + c - '0';
		c = getchar();
	}
	return x * f;
}
struct node{
	int l, r, p;
	vector<int>id;
};
vector<pair<int, int> >l;
vector<node>tmp;
vector<node>s;
int ans[10010], n;
int query(int l1, int r1, int v1, int l2, int r2, int v2)
{
	//cout<<l1<<' '<<r1<<' '<<v1<<endl;
	//cout<<l2<<' '<<r2<<' '<<v2<<endl;
	fflush(stdout);
	cout<<"0 ";
	for(int i = 1;i <= r1;i ++)cout<<v1<<' ';
	for(int i = l2;i <= n;i ++)cout<<v2<<' ';
	cout<<'\n';
	fflush(stdout);
	return read();
}
void print()
{
	for(int i = 0;i< s.size();i ++)
	{
		cout<<s[i].l<<' '<<s[i].r<<' '<<s[i].p<<endl;
		for(int j = 0;j < s[i].id.size();j ++)
		{
			cout<<s[i].id[j]<<' ';
		}
		cout<<endl;
	}
}
signed main()
{
	n = read();
	int las = 1;
	node lyw;
	lyw.l = 1;
	lyw.r = n;
	lyw.p = 1;
	for(int i = 1;i<= n;i ++)lyw.id.push_back(i);
	s.push_back(lyw);
	while(s.size() != n)
	{
		tmp.clear();
		for(int i = 0;i < s.size();i ++)
		{
			int len = s[i].id.size(), qwq = 0;
			if(i != 0)las = s[0].id[0];
			else if(s.size() > 1)las = qwq = s[1].id[0];
			l.clear();
			int left = s[i].l, right = s[i].r, mid;
			//cout<<left<<' '<<right<<endl;
			if(left == right)
			{
				tmp.push_back(s[i]);
				continue;
			}
			mid = left + right >> 1;
			node le, ri;
			le.l = s[i].l;
			le.r = mid;
			le.p = 2 * s[i].p;
			ri.l = mid+1;
			ri.r = s[i].r;
			ri.p = 2 * s[i].p + 1;
			
			
			for(int j = 0;j+1 < len;j += 2)
			{
				int x = query(left, mid, s[i].id[j], mid+1, right, s[i].id[j+1]);
				if(x == 0)
				{
					le.id.push_back(s[i].id[j+1]);
					ri.id.push_back(s[i].id[j]);
					qwq = s[i].id[j];
				}
				else if(x == 2)
				{
					le.id.push_back(s[i].id[j]);
					ri.id.push_back(s[i].id[j+1]);
					qwq = s[i].id[j + 1];
				}
				else{
					l.push_back(make_pair(s[i].id[j], s[i].id[j + 1]));
				}
			}
			if((right - left + 1) & 1)
			{
				int x;
				if(qwq)
				{
					x = query(left, mid, s[i].id[len - 1], mid+1, right, qwq);
					if(x == 1)
					{
						ri.id.push_back(s[i].id[len - 1]);
					}
					else if(x == 2)
					{
						le.id.push_back(s[i].id[len - 1]);
					}
				}
				else{
					x = query(left, mid, s[i].id[len - 1], mid+1, right, las);
					if(x == 0)
					{
						ri.id.push_back(s[i].id[len - 1]);
					}
					else if(x == 2)
					{
						le.id.push_back(s[i].id[len - 1]);
					}
				}
			}	
			len = l.size();
			for(int j = 0;j+1 < len;j += 2)
			{
				int x = query(left, mid, l[j].first, mid+1, right, l[j+1].first);
				if(x == 0)
				{
					le.id.push_back(l[j+1].first);
					le.id.push_back(l[j+1].second);
					ri.id.push_back(l[j].first);
					ri.id.push_back(l[j].second);
				}
				else if(x == 2)
				{
					le.id.push_back(l[j].first);
					le.id.push_back(l[j].second);
					ri.id.push_back(l[j+1].first);
					ri.id.push_back(l[j+1].second);
				}
				else{
					int x;
					if(qwq)
					{
						x = query(left, mid, l[j].first, mid+1, right, qwq);
						if(x == 1)
						{
							ri.id.push_back(l[j].first);
							ri.id.push_back(l[j].second);
							ri.id.push_back(l[j+1].first);
							ri.id.push_back(l[j+1].second);
						}
						else if(x == 2)
						{
							le.id.push_back(l[j].first);
							le.id.push_back(l[j].second);
							le.id.push_back(l[j+1].first);
							le.id.push_back(l[j+1].second);
						}
					}
					else{
						x = query(left, mid, l[j].first, mid+1, right, las);
						if(x == 0)
						{
							ri.id.push_back(l[j].first);
							ri.id.push_back(l[j].second);
							ri.id.push_back(l[j+1].first);
							ri.id.push_back(l[j+1].second);
						}
						else
						{
							le.id.push_back(l[j].first);
							le.id.push_back(l[j].second);
							le.id.push_back(l[j+1].first);
							le.id.push_back(l[j+1].second);
						}
					}
				}
			}
			if(len&1)
			{
				int x;
				if(qwq)
				{
					x = query(left, mid, l[len - 1].first, mid+1, right, qwq);
					if(x == 1)
					{
						ri.id.push_back(l[len - 1].first);
						ri.id.push_back(l[len - 1].second);
					}
					else if(x == 2)
					{
						le.id.push_back(l[len - 1].first);
						le.id.push_back(l[len - 1].second);
					}
				}
				else{
					x = query(left, mid, l[len - 1].first, mid+1, right, las);
					if(x == 0)
					{
						ri.id.push_back(l[len - 1].first);
						ri.id.push_back(l[len - 1].second);
					}
					else
					{
						le.id.push_back(l[len - 1].first);
						le.id.push_back(l[len - 1].second);
					}
				}
			}
			
			//for(int i = 0;i < le.id.size();i ++)cout<<le.id[i]<<' ';
			//for(int i = 0;i < ri.id.size();i ++)cout<<ri.id[i]<<' ';
			//cout<<endl;
			tmp.push_back(le);
			tmp.push_back(ri);
		}
		s.clear();
		for(int i = 0;i < tmp.size();i ++)s.push_back(tmp[i]);
		//print();
	}
	cout<<1<<' ';
	for(int i = 0;i < s.size();i ++)ans[s[i].l] = s[i].id[0];
	for(int i = 1;i <= n;i ++)cout<<ans[i]<<' ';
	return 0;
}