#include<bits/stdc++.h>
using namespace std;
#ifdef ONLINE_JUDGE
#include "sphinx.h"
#endif
#ifndef ONLINE_JUDGE
int perform_experiment(vector<int>E){
	return 0;
}
#endif
int n;
vector<int>C,G;
int query(int l,int r,int c,int m){
	for(int i=0;i<n;++i)C[i]=c;
	for(int i=l;i<=r;++i)C[2*i+m]=-1;
	return perform_experiment(C);
}
void solve(int l,int r,vector<int>g,int m){
	if(l>r)return;
	if(l==r){
		if((signed)g.size()>1){
			for(auto c:g){
				int a=query(l,r,c,m);
				if(a==1){
					G[2*l+m]=c;
					break;
				}
			}
		}else G[2*l+m]=g[0];
		return;
	}
	int mid=(l+r)>>1;
	vector<int>g1,g2;
	for(auto c:g){
		int a=query(l,mid,c,m);
		if(a==2*(mid-l+1)+1-(2*l+m==0)){
			g2.emplace_back(c);
		}else{
			g1.emplace_back(c);
			int b=query(mid+1,r,c,m);
			if(b!=2*(r-mid)+1-(2*r+m==n-1)){
				g2.emplace_back(c);
			}
		}
	}
	solve(l,mid,g1,m);
	solve(mid+1,r,g2,m);
}
vector<int>find_colours(int N,vector<int>X,vector<int>Y){
	n=N;
	C.resize(n);G.resize(n);
	vector<int>zs;
	for(int i=0;i<n;++i)zs.emplace_back(i);
	solve(0,n/2,zs,0);
	solve(0,(n-1)/2,zs,1);
	return G;
}
#ifndef ONLINE_JUDGE
int main(){
	return 0;
}
#endif