#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<random>
#define rep(i, a, b) for(int i = (a); i <= (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
using namespace std;
const int N = 1010;
mt19937 rnd(42);
int n, ans[N];

int query(int mid, int x, int y){
	putchar('0');
	rep(i, 1, mid) printf(" %d", x);
	rep(i, mid + 1, n) printf(" %d", y);
	putchar('\n'); fflush(stdout);
	int ret; scanf("%d", &ret); return ret;
}

void solve(int l, int r, const vector<int> &a){
	if(l == r) {ans[l] = a[0]; return;}
	int mid = (l+r)>>1;
	vector<int> vl, vr;
	int t = -1;
	rep(i, 0, (int)a.size()-1){
		if(!~t) {t = i; continue;}
		int ret = query(mid, a[t], a[i]);
		if(ret == 1) continue;
		rep(j, t, i-1) (ret ? vl : vr).push_back(a[j]);
		(ret ? vr : vl).push_back(a[i]);
		t = -1;
		if(vl.size() == mid-l+1 || vr.size() == r-mid){
			rep(j, i+1, (int)a.size()-1)
				(vl.size() == mid-l+1 ? vr : vl).push_back(a[j]);
			break;
		}
	}
	solve(l, mid, vl), solve(mid + 1, r, vr);
}

int main(){
	scanf("%d", &n);
	vector<int> a;
	rep(i, 1, n) a.push_back(i);
	solve(1, n, a);
	putchar('1');
	rep(i, 1, n) printf(" %d", ans[i]);
	putchar('\n');
	return 0;
}