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

#define int long long

const int MAXN = 2000;

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

struct Pair {
	int sumd, sz1, sz2;
	int age_old, age_new;
	int id1, id2;
	bool operator < (const Pair& rhs) const {
		if (sumd * rhs.sz1 * rhs.sz2 != rhs.sumd * sz1 * sz2) {
			return sumd * rhs.sz1 * rhs.sz2 < rhs.sumd * sz1 * sz2;
		}
		if (age_old != rhs.age_old) {
			return age_old < rhs.age_old;
		}
		return age_new < rhs.age_new;
	}
	
	Pair(int _sumd, int _sz1, int _sz2, int _age_old, int _age_new, int _id1, int _id2) {
		sumd = _sumd;
		sz1 = _sz1;
		sz2 = _sz2;
		age_old = _age_old;
		age_new = _age_new;
		id1 = _id1;
		id2 = _id2;
		assert(age_old < age_new);
	}
};

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(Pair(dist[i][j], 1, 1, age[i], age[j], i, j));
			}
		}
	}
	
	for (int t = 1; t <= n - 1; ++t) {
		Pair cur = *s.begin();
		s.erase(s.begin());
		int u = cur.id1;
		int v = cur.id2;
		
		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(Pair(dist[u][i], sz[u], sz[i], age[u], age[i], u, i));
				} else {
					s.erase(Pair(dist[i][u], sz[i], sz[u], age[i], age[u], i, u));
				}
				
				if (age[v] < age[i]) { // v is older
					s.erase(Pair(dist[v][i], sz[v], sz[i], age[v], age[i], v, i));
				} else {
					s.erase(Pair(dist[i][v], sz[i], sz[v], age[i], age[v], 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(Pair(dist[i][v], sz[i], sz[v], age[i], age[v], i, v)); // i must be older than v
			}
		}
		
		fa[u] = v;
		
		cout << sz[v] << endl;
	}
	
	return 0;
}