#include <bits/stdc++.h>
#define fp(i, a, b) for(int i = (a), ed = (b); i <= ed; ++i)
#define fb(i, a, b) for(int i = (a), ed = (b); i >= ed; --i)
#define go(u, i) for(int i = head[u]; i; i = e[i].nxt)
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
inline int rd() {
	register int x(0), f(1); register char c(getchar());
	while (c < '0' || '9' < c) { if (c == '-')f = -1; c = getchar(); }
	while ('0' <= c && c <= '9')x = x*10 + c-'0', c = getchar();
	return x*f;
}
inline LL RD() {
	register LL x(0); register int f(1); register char c(getchar());
	while (c < '0' || '9' < c) { if (c == '-')f = -1; c = getchar(); }
	while ('0' <= c && c <= '9')x = x*10 + c-'0', c = getchar();
	return x*f;
}
inline int int_rand(int l, int r){
	int res = 1.0l*rand()/RAND_MAX*(r-l+1);
	if(res == r-l+1)res = r-l;
	return l+res;
}
inline LL LL_rand(LL l, LL r){
	LL res = 1.0l*rand()/RAND_MAX*(r-l+1);
	if(res == r-l+1)res = r-l;
	return l+res;
}
const int maxn = 2010;
const double eps = 1e-3;
int n, x[maxn], y[maxn], vis[maxn];
struct pdi{
	double dist;
	int p;
};
struct node{
	set<pdi> st;
	int id, siz;
	double d[maxn];
}a[maxn];
inline bool operator < (const pdi &x, const pdi &y){
	if(fabs(x.dist-y.dist) >= eps)return x.dist < y.dist;
	return a[x.p].id < a[y.p].id;
}
inline int dist(int p, int q){
	return (x[p]-x[q])*(x[p]-x[q]) + (y[p]-y[q])*(y[p]-y[q]);
}
int main(){
//	freopen("a.in", "r", stdin);
//	freopen("a.out", "w", stdout);
	n = rd();
	fp(i, 1, n)x[i] = rd(), y[i] = rd(), a[i].id = i, a[i].siz = 1;
	fp(i, 1, n){
		fp(j, 1, n)if(i != j){
			a[i].d[j] = dist(i, j);
			a[i].st.insert((pdi){a[i].d[j], j});
		}
	}
	fp(t, 2, n){
		pii now = make_pair(0, 0); double dist = 1e18;
		fp(i, 1, n)if(!vis[i]){
//			printf("%d: ", a[i].id);
//			for(auto &x : a[i].st)printf("%lf ", x.dist); puts("");
			if(dist-a[i].st.begin()->dist >= eps){
				int p = a[i].st.begin()->p, q = i;
				if(a[p].id < a[q].id)swap(p, q);
				now = make_pair(p, q), dist = a[i].st.begin()->dist;
			}else if(fabs(dist-a[i].st.begin()->dist) < eps){
				int p = a[i].st.begin()->p, q = i;
				if(a[p].id < a[q].id)swap(p, q);
				if(a[p].id < a[now.first].id)now = make_pair(p, q);
				else if(a[p].id == a[now.first].id && a[q].id < a[now.second].id)now = make_pair(p, q);
			}
		}
		int p = now.first, q = now.second;
		fp(i, 1, n)if(!vis[i] && i != p && i != q){
			double dist1 = a[i].d[p], dist2 = a[i].d[q];
			a[i].st.erase((pdi){a[i].d[p], p}), a[p].st.erase((pdi){a[p].d[i], i});
			a[i].st.erase((pdi){a[i].d[q], q}), a[q].st.erase((pdi){a[q].d[i], i});
			dist1 *= a[i].siz*a[p].siz, dist2 *= a[i].siz*a[q].siz;
			a[i].d[p] = a[p].d[i] = (dist1+dist2)/a[i].siz/(a[p].siz+a[q].siz);
		}
//		printf("%d %d\n", a[p].id, a[q].id);
		vis[q] = 1, a[p].siz += a[q].siz, a[p].id = n+t-1, a[p].st.erase((pdi){a[p].d[q], q});
		fp(i, 1, n)if(!vis[i] && i != p && i != q){
			a[i].st.insert((pdi){a[i].d[p], p}), a[p].st.insert((pdi){a[p].d[i], i});
		}
		printf("%d\n", a[p].siz);
	}
	return 0;
}