#include <bits/stdc++.h>
using namespace std;

#define int long long

typedef pair<int, int> pii;
typedef pair<double, pair<pii, pii> > Pair;
// distance, age old, age new, id old, id new

#define fi first
#define se second
#define mk make_pair

const int MAXN = 2000;

int n, X[MAXN + 5], Y[MAXN + 5];

int dist[MAXN + 5][MAXN + 5];

int fa[MAXN + 5], sz[MAXN + 5], age[MAXN + 5];

int getfa(int u) {
	if (fa[u] == u) {
		return u;
	}
	return fa[u] = getfa(fa[u]);
}

signed main() {
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		cin >> X[i] >> Y[i];
		fa[i] = i;
		sz[i] = 1;
		age[i] = -n + i; // the smaller this number, the older the constellation
	}
	
	set<Pair> s;
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= n; ++j) {
			dist[i][j] = (X[i] - X[j]) * (X[i] - X[j]) + (Y[i] - Y[j]) * (Y[i] - Y[j]);
			if (i < j) {
				s.insert(mk(dist[i][j], mk(mk(age[i], age[j]), mk(i, j))));
			}
		}
	}
	
	for (int t = 1; t <= n - 1; ++t) {
		Pair cur = *s.begin();
		s.erase(s.begin());
		int u = cur.se.se.fi;
		int v = cur.se.se.se;
		
		assert(getfa(u) == u);
		assert(getfa(v) == v);
		
		// merge u int v
		if (sz[u] > sz[v]) {
			swap(u, v);
		}
		
		for (int i = 1; i <= n; ++i) {
			if (getfa(i) == i && i != u && i != v) {
				if (age[u] < age[i]) { // u is older
					s.erase(mk((double)dist[u][i] / sz[u] / sz[i], mk(mk(age[u], age[i]), mk(u, i))));
				} else {
					s.erase(mk((double)dist[i][u] / sz[u] / sz[i], mk(mk(age[i], age[u]), mk(i, u))));
				}
				
				if (age[v] < age[i]) { // u is older
					s.erase(mk((double)dist[v][i] / sz[v] / sz[i], mk(mk(age[v], age[i]), mk(v, i))));
				} else {
					s.erase(mk((double)dist[i][v] / sz[v] / sz[i], mk(mk(age[i], age[v]), mk(i, v))));
				}
			}
		}
		
		sz[v] += sz[u];
		age[v] = t;
		
		for (int i = 1; i <= n; ++i) {
			if (getfa(i) == i && i != u && i != v) {
				
				dist[i][v] += dist[i][u];
				dist[v][i] += dist[u][i];
				
				s.insert(mk((double)dist[i][v] / sz[v] / sz[i], mk(mk(age[i], age[v]), mk(i, v)))); // i must be older than v
			}
		}
		
		fa[u] = v;
		
		cout << sz[v] << endl;
	}
	
	return 0;
}