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

const int DEBUG = 1;
vector<int> Target;
int Answer[1 << 19];
int Queries = 0;

int Ask(vector<int> Vec) {
	Queries += 1;
	if (DEBUG == 1) {
		printf("0");
		for (int i = 0; i < (int)Vec.size(); i++) printf(" %d", Vec[i]);
		printf("\n");
		fflush(stdout);
		int r; cin >> r;
		return r;
	}
	if (DEBUG == 2) {
		int cnt = 0;
		for (int i = 0; i < (int)Vec.size(); i++) cnt += (Target[i] == Vec[i] ? 1 : 0);
		return cnt;
	}
}

int Print(vector<int> Vec) {
	if (DEBUG == 1) {
		printf("1");
		for (int i = 0; i < (int)Vec.size(); i++) printf(" %d", Vec[i]);
		printf("\n");
		fflush(stdout);
		return 1;
	}
	if (DEBUG == 2) {
		int cnt = 0;
		for (int i = 0; i < (int)Vec.size(); i++) cnt += (Target[i] == Vec[i] ? 1 : 0);
		return (cnt == (int)Vec.size() ? 1 : 0);
	}
}

void Solve(int N, vector<int> val, vector<int> perm, vector<int> dame) {
	if (val.size() == 1) {
		Answer[perm[0]] = val[0];
		return;
	}

	// Interactive Init
	int sz = val.size();
	int mid = sz / 2;
	vector<vector<int>> Current;
	vector<vector<int>> Next;
	vector<int> Left;
	vector<int> Rigt;
	for (int idx : val) Current.push_back(vector<int>{idx});
	int remL = mid;
	int remR = sz - mid;

	// Interactive Main
	while (Current.size() >= 1) {
		for (int i = 0; i < (int)Current.size(); i += 2) {
			int cl = i;
			int cr = i + 1; if (cr == Current.size()) cr--;

			// Main Case
			if (cr - cl == 1) {
				vector<int> Vec = dame;
				for (int i =  0; i < mid; i++) Vec[perm[i]] = Current[cl][0];
				for (int i = mid; i < sz; i++) Vec[perm[i]] = Current[cr][0];
				int r = Ask(Vec);
				if (r == 2) {
					for (int idx : Current[cl]) Left.push_back(idx);
					for (int idx : Current[cr]) Rigt.push_back(idx);
					remL -= Current[cl].size();
					remR -= Current[cr].size();
				}
				if (r == 0) {
					for (int idx : Current[cr]) Left.push_back(idx);
					for (int idx : Current[cl]) Rigt.push_back(idx);
					remL -= Current[cr].size();
					remR -= Current[cl].size();
				}
				if (r == 1) {
					vector<int> New;
					for (int idx : Current[cl]) New.push_back(idx);
					for (int idx : Current[cr]) New.push_back(idx);
					Next.push_back(New);
				}
			}

			// Other Case
			if (cr - cl == 0) {
				int div2L = 0, pl = remL;
				int div2R = 0, pr = remR;
				while (pl % 2 == 0 && div2L <= 20) { div2L += 1; pl /= 2; }
				while (pr % 2 == 0 && div2R <= 20) { div2R += 1; pr /= 2; }
				if (div2L < div2R) {
					for (int idx : Current[cl]) Left.push_back(idx);
					remL -= Current[cl].size();
				}
				else {
					for (int idx : Current[cr]) Rigt.push_back(idx);
					remL -= Current[cr].size();
				}
			}
		}

		// Update
		Current = Next;
		Next.clear();
	}

	// Recursion
	vector<int> permL;
	vector<int> permR;
	for (int i =  0; i < mid; i++) permL.push_back(perm[i]);
	for (int i = mid; i < sz; i++) permR.push_back(perm[i]);
	Solve(N, Left, permL, dame);
	Solve(N, Rigt, permR, dame);
}

int main() {
	// Input
	int N; cin >> N;
	if (N == 1) {
		vector<int> Ans = {1};
		Print(Ans);
		return 0;
	}
	vector<int> perm(N, 0);
	vector<int> val(N, 0);
	for (int i = 0; i < N; i++) perm[i] = i;
	for (int i = 0; i < N; i++) val[i] = i + 1;
	for (int i = 0; i < N * 10; i++) swap(perm[rand() % N], perm[rand() % N]);

	// Decide Target
	if (DEBUG == 2) {
		Target = vector<int>(N, 0);
		for (int i = 0; i < N; i++) Target[i] = i + 1;
		for (int i = 0; i < N * 10; i++) swap(Target[rand() % N], Target[rand() % N]);
	}

	// Init
	vector<int> dame;
	while (true) {
		vector<int> perm2(N, 0);
		for (int i = 0; i < N; i++) perm2[i] = i + 1;
		for (int i = 0; i < N * 10; i++) swap(perm2[rand() % N], perm2[rand() % N]);
		int r = Ask(perm2);
		if (r == 0) { dame = perm2; break; }
	}

	// Solve
	Solve(N, val, perm, dame);

	// Output
	vector<int> Ans;
	for (int i = 0; i < N; i++) Ans.push_back(Answer[i]);
	int v = Print(Ans);
	if (DEBUG == 2) {
		cout << v << endl;
		cout << Queries << endl;
	}
	return 0;
}