#include<bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i = j;i <= k;++i)
#define repp(i,j,k) for(int i = j;i >= k;--i)
#define pb push_back
#define mp make_pair
#define fr first
#define se second
#define P pair<int,int>
#define Pp pair< pair<double, pair<int,int> > , pair<int,int> >
#define time tim
int n;
struct node{
	int x,y;
}e[2010];
double Dis[2010][2010];
int dis[2010][2010],f[2010],sz[2010],tim[2010];
struct point{
	double value;
	int id1,id2;
	bool operator < (const point b)const{
		if(value != b.value)
			return value < b.value;
		if( min( tim[id1] , tim[id2] ) != min( tim[b.id1] , tim[b.id2] ) )
			return min( tim[id1] , tim[id2] ) < min( tim[b.id1] , tim[b.id2] );
		return max( tim[id1] , tim[id2]) < max( tim[b.id1] , tim[b.id2]);
	}
};
set<point>s;
int get(int x) {
	if(f[x] == x) return x;
	else {
		f[x] = get(f[x]);
		return f[x];
	}
}
void merge(int x,int y,int t) {
	int fx = get(x) , fy = get(y);
	f[fy] = fx; sz[fx] += sz[fy];
	tim[fx] = t;
}
void del(int id) {
	rep(i,1,n) if( i == get(i) && get(i) != id ) Dis[ min(i,id) ][ max(i,id) ] = 0;
}
void insert(int id) {
	rep(i,1,n) Dis[id][i] = 0 , Dis[i][id] = 0;
	rep(i,1,n) if( get(i) == id ) {
		rep(j,1,n) if( get(j) != id ) {
			int idd = get(j);
			Dis[ min(id,idd) ][ max(id,idd) ] += dis[i][j];
		}
	}
	rep(i,1,n) if( get(i) == i && get(i) != id ) {
		Dis[min(i,id)][max(i,id)] /= (1.0*sz[i]*sz[id]);
		s.insert( {Dis[min(i,id)][max(i,id)],min(i,id),max(i,id)} );
	}
}
void output() {
	set<point>::iterator it;
	for(it = s.begin();it != s.end();it++)
		printf("%.10lf %d %d\n",it->value,it->id1,it->id2);
}
int main() {
	scanf("%d",&n);
	rep(i,1,n) scanf("%d%d",&e[i].x,&e[i].y);
	rep(i,1,n) f[i] = i , sz[i] = 1 , tim[i] = i - n;
	rep(i,1,n) rep(j,i+1,n) {
		dis[i][j] = (e[i].x-e[j].x)*(e[i].x-e[j].x) + (e[i].y-e[j].y)*(e[i].y-e[j].y);
		dis[j][i] = dis[i][j]; Dis[i][j] = 1.0*dis[i][j]; Dis[j][i] = 1.0*dis[i][j];
		s.insert( {Dis[i][j],i,j} );
	}
	rep(t,1,n-1) {
		point x = *s.begin();
		int id1,id2;
		while(1) {
			id1 = x.id1 , id2 = x.id2;
			if( get(id1) != id1 || get(id2) != id2 ) {s.erase(s.begin());x = *s.begin();continue;}
			if( Dis[id1][id2] == x.value ) break;
			s.erase(s.begin());x = *s.begin();
		}
	//	output();
		// printf("#%d %d\n",id1,id2);
		merge( id1 , id2 , t );
		//rep(i,1,n) printf("*%d ",get(i)); printf("\n");
		int res = 0;
		rep(i,1,n) if( get(i) == id1 ) res++;
		printf("%d\n",res);
		insert( id1 );
	}
	return 0;
}