#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define Sz(x) (int)(x).size()
#define bit(x) (1ll << (x))
using ll = long long;
using db = double;
using ull = unsigned long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vii = vector<vi>;
using vl = vector<ll>;
using vll = vector<vl>;
using vs = vector<string>;
using vd = vector<db>;
mt19937 mrand(time(0));

int n;
int query(vi v)
{
	cout << 0 << " ";
	for (int i = 1; i <= n; i++)
		cout << v[i] << " ";
	cout << endl;
	int res;
	cin >> res;
	return res;	
}

void solve(void)
{
	cin >> n;

	vi a(n + 2);
	for (int i = 1; i <= n; i++)
		a[i] = i;

	vi ans(n + 2), que(n + 2);
	function<void(int, int)> dfs = [&](int l, int r)
	{
		if (l == r)
		{
			ans[l] = a[l];
			return;
		}

		int mid = (l + r) / 2;
		vi vis(n + 2);
		vii e(n + 2);
		vi fa(n + 2);
		for (int i = l; i <= r; i++)
		{
			fa[a[i]] = a[i];
			e[a[i]].pb(a[i]);
		}

		function<int(int)> find = [&](int u)
		{
			if (fa[u] == u) return u;
			return fa[u] = find(fa[u]);
		};

		while (true)
		{
			vi v;
			for (int i = l; i <= r; i++)
			{
				int f = find(a[i]);
				if (f == a[i] && !vis[f])
				{
					// cerr << f << " ";
					v.pb(f);
				}
			}
			// cerr << "\n";

			if (Sz(v) == 0)
				break;
			else if (Sz(v) == 1)
			{
				int cl = 0;
				for (int i = l; i <= r; i++)
					if (vis[a[i]] == -1) cl++;

				int u = v[0];

				if (cl != mid - l + 1)
				{
					assert(cl + Sz(e[u]) == mid - l + 1);
					for (auto x : e[u])
					{
						assert(vis[x] == 0);
						vis[x] = -1;
					}
				}
				else
					for (auto x : e[u])
					{
						assert(vis[x] == 0);
						vis[x] = 1;
					}
				break;
			}
			else
			{
				random_shuffle(all(v));
				int m = Sz(v);
				for (int i = 0; i < m; i += 2)
				{
					int x = v[i], y = v[(i + 1) % m];
					for (int j = 1; j <= mid; j++)
						que[j] = x;
					for (int j = mid + 1; j <= n; j++)
						que[j] = y;

					int res = query(que);
					if (res == 2)
					{
						for (auto a : e[x])
							vis[a] = -1;
						for (auto a : e[y])
							vis[a] = 1;
					}
					else if (res == 0)
					{
						swap(x, y);
						for (auto a : e[x])
							vis[a] = -1;
						for (auto a : e[y])
							vis[a] = 1;
					}
					else
					{
						// cerr << x << " " << y << " " << vis[y] << "\n";
						if (vis[x])
						{
							for (auto a : e[y])
								vis[a] = vis[x];
							
						}
						else if (vis[y])
						{
							for (auto a : e[x])
							{
								// cerr << a << "\n";
								vis[a] = vis[y];							
							}
						}
						else
						{
							fa[y] = x;
							for (auto a : e[y])
								e[x].pb(a);
							e[y].clear();
						}
					}
				}
			}
		}

		// cerr << "YES\n";
		vi vl, vr;
		int pl = l, pr = mid + 1;
		for (int i = l; i <= r; i++)
		{
			assert(vis[a[i]]);
			if (vis[a[i]] == -1)
				vl.pb(a[i]);
			else
				vr.pb(a[i]);
		}

		for (auto x : vl)
			a[pl++] = x;
		for (auto x : vr)
			a[pr++] = x;
		
		dfs(l, mid);
		dfs(mid + 1, r);
	};

	dfs(1, n);

	cout << 1 << " ";
	for (int i = 1; i <= n; i++)
		cout << ans[i] << " ";
	cout << endl;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	// cout << fixed << setprecision(10);

	int T = 1;
	// cin >> T;
	for (int i = 1; i <= T; i++)
	solve();

	return 0;
}