#include <bits/stdc++.h>
#include <random>

#define MP make_pair


using namespace std;
using LL = long long;
using ULL = unsigned long long;
using DB = double;

const int maxn = 2005;

int merge_time[maxn];
DB dist[maxn][maxn];
DB sumx[maxn][2], sumy[maxn][2], siz[maxn];

struct star{
	DB value;
	int id1, id2;

	bool operator < (const star b)const{
		if(value != b.value)
			return value < b.value;
		if(min(merge_time[id1], merge_time[id2]) != min(merge_time[b.id1], merge_time[b.id2]))
			return min(merge_time[id1], merge_time[id2]) < min(merge_time[b.id1], merge_time[b.id2]);
		return max(merge_time[id1], merge_time[id2]) < max(merge_time[b.id1], merge_time[b.id2]);
	}
};

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);

	int n;
	cin >> n;

	set<star> st;
	for(int i = 1; i <= n; ++i){
		cin >> sumx[i][0] >> sumy[i][0];
		sumx[i][1] = sumx[i][0] * sumx[i][0];
		sumy[i][1] = sumy[i][0] * sumy[i][0];
		siz[i] = 1;
		merge_time[i] = i;
	}

	auto rem = [&](int i, int j) -> void{
		if(!siz[i] || !siz[j] || i == j)	
			return;
		int u = min(i, j), v = max(i, j);
		st.erase({dist[u][v], u, v});
	};

	auto add = [&](int i, int j) -> void{
		if(!siz[i] || !siz[j] || i == j)	
			return;
		int u = min(i, j), v = max(i, j);
		st.insert({dist[u][v], u, v});
	};
	
	auto calc_dist = [&](int i, int j) -> DB{
		auto _x = sumx[i][1] * siz[j] + sumx[j][1] * siz[i] - 2 * sumx[i][0] * sumx[j][0];
		auto _y = sumy[i][1] * siz[j] + sumy[j][1] * siz[i] - 2 * sumy[i][0] * sumy[j][0];
		return (_x + _y) / siz[i] / siz[j];
	};

	auto merge = [&](int i, int j, int now) -> void{
		for(int k = 1; k <= n; ++k){
			rem(i, k); rem(j, k);
		}

		siz[i] += siz[j];
		siz[j] = 0;
		sumx[i][0] += sumx[j][0]; sumx[i][1] += sumx[j][1];
		sumy[i][0] += sumy[j][0]; sumy[i][1] += sumy[j][1];
		sumy[i][0] = sumy[i][1] = sumx[i][0] = sumx[i][1] = 0;
		dist[i][j] = 0;
		merge_time[i] = now;
		merge_time[j] = n * n;

		for(int k = 1; k <= n; ++k){
			add(i, k);
		}
	};

	for(int i = 1; i <= n; ++i){
		for(int j = i + 1; j <= n; ++j){
			DB t = calc_dist(i, j);
			dist[i][j] = t;
			st.insert({dist[i][j], i, j});
		}
	}

	for(int round = 1; round <= n - 1; ++round){
		auto tp = *(st.begin());
		st.erase(st.begin());
		int u = tp.id1, v = tp.id2;
		merge(u, v, n + round);
		cout << siz[u] << '\n';
	}
	return 0;
}