#include <bits/stdc++.h>
using namespace std;
using LL = long long;
#define fi first
#define se second
const int MAX_N = 2e3 + 5;
int N, tim, T[MAX_N], sz[MAX_N];
LL X[MAX_N], Y[MAX_N], A[MAX_N], B[MAX_N], C[MAX_N];
struct node { 
	LL sum, sz;
	pair<int, int> e;
} ;
bool operator == (const node &l, const node &r) {
	return l.sum == r.sum && l.e == r.e && l.sz == r.sz;
}
bool operator < (const node &l, const node &r) {
	LL tl = l.sum * r.sz, tr = r.sum * l.sz;
	if (tl != tr) return tl < tr;
	else {
		auto u = make_pair(T[l.e.fi], T[l.e.se]);
		auto v = make_pair(T[r.e.fi], T[r.e.se]);
		return u > v;
	}
}
int pa[MAX_N];
int getf(int x) { while (x != pa[x]) x = pa[x] = pa[pa[x]]; return x; }
void unite(int x, int y) {
	x = getf(x), y = getf(y);
	A[x] += A[y], B[x] += B[y], C[x] += C[y];
	sz[x] += sz[y], T[x] = tim--;
	pa[y] = x;
}
int main() {
	scanf("%d", &N); tim = N;
	for (int i = 1; i <= N; i++) {
		scanf("%lld %lld", X + i, Y + i), pa[i] = i;
		A[i] = X[i] * X[i] + Y[i] * Y[i];
		B[i] = X[i];
		C[i] = Y[i];
		T[i] = tim--;
		sz[i] = 1;
	}
	multiset<node> S;
	for (int i = 1; i <= N; i++) 
		for (int j = i + 1; j <= N; j++)
			S.insert((node){A[i] + A[j] - 2 * B[i] * B[j] - 2 * C[i] * C[j], 1, make_pair(i, j)});
	for (int stp = 1; stp < N; stp++) {
		auto p = *S.begin(); S.erase(S.begin()); 
		int u = p.e.fi, v = p.e.se;
		for (int i = 1; i <= N; i++) {
			if (i == getf(i)) {
				if (i == u || i == v) continue;
				S.erase(S.find((node){A[i] + A[u] - 2 * B[i] * B[u] - 2 * C[i] * C[u], sz[i] * sz[u], 
								(T[i] < T[u] ? make_pair(u, i) : make_pair(i, u))}));
				S.erase(S.find((node){A[i] + A[v] - 2 * B[i] * B[v] - 2 * C[i] * C[v], sz[i] * sz[v],
								(T[i] < T[v] ? make_pair(v, i) : make_pair(i, v))}));
			}
		}
		unite(u, v);
		printf("%d\n", sz[getf(u)]);
		for (int i = 1; i <= N; i++) {
			if (i == getf(i) && i != u) {
				S.insert((node){A[i] + A[u] - 2 * B[i] * B[u] - 2 * C[i] * C[u], sz[i] * sz[u], 
								(T[i] < T[u] ? make_pair(u, i) : make_pair(i, u))});
			}
		}
	}
	return 0;
}