#include <bits/stdc++.h>
using namespace std;
struct node
{
	int x;
	int y;
	int size;
}a[105];
int main()
{
	int n;
	cin>>n;
	for (int i=1;i<=n;i++)
	{
		cin>>a[i].x>>a[i].y;
		a[i].size=i;
	}
	for (int i=1;i<=n;i++)
	{
		double ma=-1,ans=0;
		for (int j=1;j<=n;j++)
		{
			double z=(a[i].x-a[j].x)*(a[i].x-a[j].x),w=(a[i].y-a[j].y)*(a[i].x-a[j].y);
			if (sqrt(z+w)>ma)
			{
				ma=max(ma,sqrt(z+w));
				ans=a[j].size;
			}
		}
		cout<<ans<<endl;
	}
	return 0;
}