#include<bits/stdc++.h>
using namespace std;
const int N=1005;
int perform_experiment(vector<int> E);
int n;
int col[N];
int ask()
{
	vector <int> E;
	E.resize(n);
	for(int i=0;i<n;i++) E[i]=col[i];
	return perform_experiment(E);
}
int hav[N],chk[N],cnt;
int check(int x,int mid)
{
	for(int i=0;i<n;i++) col[i]=n;
	col[x]=-1;
	for(int i=1;i<=mid;i++) col[hav[i]]=-1;
	return ask()==mid+1;
}
int find(int x)
{
	int l=1,r=cnt;
	while(l<r)
	{
		int mid=(l+r)/2;
		if(check(x,mid)) r=mid;
		else l=mid+1;
	}
	return l;
}
vector <int> find_colours(int N,vector <int> X,vector <int> Y)
{
	n=N;
	for(int i=0;i<n;i++) col[i]=-1;
	int goal=ask()+1;
//	printf("%d\n",goal);
	for(int i=0;i<n;i++)
	{
		col[i]=n;
		if(ask()!=goal) hav[++cnt]=i,chk[i]=cnt,col[i]=-1;
	}
//	for(int i=1;i<=cnt;i++) printf("%d ",hav[i]);printf("\n");
	for(int i=0;i<n;i++)
	{
		if(chk[i]) continue;
		chk[i]=find(i);
	}
	vector <int> ret;
	for(int i=0;i<n;i++) ret.push_back(chk[i]-1);
	return ret;
}
/*
4 6
1 2 2 3
0 1
1 2
2 3
0 2
1 3
0 3
*/