// #define LOCAL
#include <bits/stdc++.h>
#define fir first
#define sec second
#define el '\n'

#ifdef LOCAL
#define FINISH cerr << "FINISH" << endl;
#else
#define FINISH ;
#endif

#ifdef LOCAL
#define debug(x) cerr << setw(4) << #x << " == " << x << endl
#else
#define debug(x)
#endif

#ifdef LOCAL
#define debugv(x)                   \
	cerr << setw(4) << #x << ":: "; \
	for (auto i : x)                \
		cerr << i << " ";           \
	cerr << endl
#else
#define debugv(x)
#endif

using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
ostream& operator<<(ostream& out, PII& x)
{
	out << x.fir << " " << x.sec << endl;
	return out;
}
mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count());
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const int N = 200020;
int n, cnt = 0;
int ans[N], a[N];
void init()
{
	cin >> n;
	cnt = 0;
#ifdef LOCAL
	vector<int> vis(n + 1, 0);
	for (int i = 1; i <= n; i++) {
		ans[i] = i;
	}
	for (int i = 1; i <= n * 1000; i++) {
		int x = rng() % n + 1;
		int y = rng() % n + 1;
		swap(ans[x], ans[y]);
	}
	/*for (int i = 1; i <= n; i++) {
		cout << ans[i] << " ";
	}
	cout << endl;*/
	// cout << endl;
	// FINISH
#endif
}
int query(vector<int>& v)
{
	cnt++;
	assert(cnt <= 6666);
	assert(v.size() == n + 1);
	int tot = 0;
#ifdef LOCAL
	/*cout << "0 ";
	for (int i = 1; i <= n; i++) {
		cout << v[i] << " ";
	}
	cout << endl;*/
	for (int i = 1; i <= n; i++) {
		if (ans[i] == v[i])
			tot++;
	}
	// cout << "! " << tot << endl;
#else
	cout << "0 ";
	for (int i = 1; i <= n; i++) {
		cout << v[i] << " ";
	}
	cout << endl;
	cin >> tot;
#endif
	return tot;
}
void getans(int l, int r, vector<int> v)
{
	/*cout << " getans " << l << " " << r << endl;
	debugv(v);*/
	assert(v.size() == r - l + 1);
	if (l == r) {
		a[l] = v[0];
		return;
	}
	int mid = (l + r) >> 1;
	shuffle(v.begin(), v.end(), rng);
	vector<int> left, right;
	int st = 0, ed = 1;
	while (ed < v.size()) {
		ed = max(ed, st + 1);
		vector<int> q(n + 1, v[st]);
		for (int i = mid + 1; i <= r; i++) {
			q[i] = v[ed];
		}
		int res = query(q);
		if (res == 2) {
			for (int i = st; i < ed; i++) {
				left.push_back(v[i]);
			}
			right.push_back(v[ed]);
			st = ed + 1;
		}
		else if (res == 0) {
			for (int i = st; i < ed; i++) {
				right.push_back(v[i]);
			}
			left.push_back(v[ed]);
			st = ed + 1;
		}
		else {
			ed++;
		}
		if (left.size() == mid - l + 1) {
			for (int i = st; i < v.size(); i++) {
				right.push_back(v[i]);
			}
			break;
		}
		if (right.size() == r - mid) {
			for (int i = st; i < v.size(); i++) {
				left.push_back(v[i]);
			}
			break;
		}
	}
	getans(l, mid, left);
	getans(mid + 1, r, right);
}
void solve()
{
	init();
	vector<int> v;
	for (int i = 1; i <= n; i++) {
		v.push_back(i);
	}
	getans(1, n, v);
	// cout << cnt << endl;
	cout << "1 ";
	for (int i = 1; i <= n; i++) {
#ifdef LOCAL
		assert(a[i] == ans[i]);
#endif
		cout << a[i] << " ";
	}
	cout << endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int T = 1;
	// cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}