# include <bits/stdc++.h>

const int32_t maxn = 1005;

int32_t n, res;

int32_t pos[maxn];

int32_t result = 0, rest = 0;

inline void guess () {
	std::cin >> n;
}

inline int32_t ask (std::vector <int32_t> p) {
	std::cout << 0 << ' ';
	for (auto i : p) std::cout << i << ' ';
	std::cout << std::endl;
	std::cin >> rest;
	return rest - (n - res);
}

std::mt19937 rd (114514);
//std::mt19937 rd (std::random_device {} ());

std::vector <int32_t> wp;

std::vector <int32_t> p, ans;

inline void makesure (const int32_t x, const int32_t y, const int32_t l1, const int32_t r1, const int32_t l2, const int32_t r2) {
	
//	std::cerr << x << ' ' << y << " l1 : " << l1 << " r1 : " << r1 << " l2 : " << l2 << " r2 : " << r2 << '\n'; 
	
	if (l1 == r1 && l2 == r2) {
		int32_t t = 0, t1 = 0, t2 = 0;
		for (int i = 1; i <= n; ++ i) {
			if (pos[i] == 0) ++ t;
			if (t == l1 && ! t1) pos[i] = x, t1 = 1; // std::cerr << "set " << i << ' ' << x << '\n';
			if (t == l2 && ! t2) pos[i] = y, t2 = 1; // std::cerr << "set " << i << ' ' << y << '\n';
		}
	//	std::cerr << "end "  << x << ' ' << y << '\n'; 
		
		return res -= 2, void ();
	}

	p.clear ();
	
	int32_t m1 = (l1 + r1) >> 1, m2 = (l2 + r2) >> 1, t = 0;
	
	for (int i = 1, w = 0; i <= n; ++ i, w = 0) {
		
		if (pos[i]) p.push_back (pos[i]), w = 1;
		else {
				++ t;
			if (l1 <= t && t <= m1) p.push_back (x), w = 1;
			if (m2 <  t && t <= r2) p.push_back (y), w = 1;
			if (w == 0) p.push_back (wp[i - 1]);
		}
	}
	
//	std::cerr << "fst ";
	
//	for (auto i : p) std::cerr << i << ' ';
	
//	std::cerr << '\n';
	
	result = ask (p), p.clear (), t = 0;
	
	if (result == 2) return makesure (x, y, l1, m1, m2 + 1, r2);
	if (result == 0) return makesure (x, y, m1 + 1, r1, l2, m2);
	
	for (int i = 1, w = 0; i <= n; ++ i, w = 0) {
		
		if (pos[i]) p.push_back (pos[i]), w = 1;
		else {	
			++ t;
			if (l1 <= t && t <= m1) p.push_back (x), w = 1;
			if (w == 0) p.push_back (wp[i - 1]);
		}
		
	}
	
//	std::cerr << "sec ";
	
//	for (auto i : p) std::cerr << i << ' ';
	
//	std::cerr << '\n';
	
	result = ask (p);
	
	if (result == 1) return makesure (x, y, l1, m1, l2, m2);
	if (result == 0) return makesure (x, y, m1 + 1, r1, m2 + 1, r2);
}

int main () {
	
	guess (), res = n;
	
	if (n == 1) return std::cout << 1 << ' ' << 1 << std::endl, 0;
	
	for (int i = 1; i <= n; ++ i) wp.push_back (i);
	
	while (ask (wp)) 
		shuffle (wp.begin (), wp.end (), rd);
	
	for (int i = 1; i <= n - (n & 1); i += 2)
		makesure (i, i + 1, 1, res, 1, res);
	
	std::cout << 1 << ' ';
	
	for (int i = 1; i <= n; ++ i) {
		if (pos[i]) std::cout << pos[i] << ' ';
		else std::cout << n << ' ';
	}
	
	std::cout << std::endl;
	
	return 0;
}

/*

6

2 3 1 6 5 4

1
0
1
1
0
1
1
4
4

5
3 1 5 2 4

0
2
1
1
0
4
3
3

*/