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

#define ff   first
#define ss   second
#define pb   push_back

typedef long long   ll;
typedef pair<ll,ll>   ii;

const int N = 2005;
const int mod = 1e9+7;
const ll oo = 1e11;

int sumx[N], sumxs[N], sumy[N], sumys[N], tmm[N], fat[N], sz[N];
int x[N], y[N];
int curr;

void ini (int n) { 
	for (int i = 0; i < n; ++i) {
		fat[i] = i;
		sumx[i] = x[i];
		sumxs[i] = x[i] * x[i];
		sumy[i] = y[i];
		sumys[i] = y[i] * y[i];
		tmm[i] = i;
		sz[i] = 1;
	}
	curr=n;
}

int fnd(int x) { 
	if (x == fat[x]) return x;
	return fat[x] = fnd(fat[x]);
}

void uni (int x, int y) { 
	int fx = fnd(x);
	int fy = fnd(y);
	fat[fx] = fy;
	sumx[fy] += sumx[fx];
	sumxs[fy] += sumxs[fx];
	sumy[fy] += sumy[fx];
	sumys[fy] += sumys[fy];
	tmm[fy] = curr++;
	sz[fy] += sz[fx];
}

int allw[N];

int main() { 
	#ifdef LOCAL
	freopen("in.txt","r",stdin);
	#endif
	int n; cin >> n;
	for (int i = 0; i < n; ++i) cin >> x[i] >> y[i];
	ini(n);
//	cout << n << endl;
	//return 0;
	for (int i = 0; i + 1 < n; ++i) { 
		int szz = 0;
		for (int j = 0; j < n; ++j) { 
			if (fnd(j) == j) {
				allw[szz++] = j;
			}
		}
		pair<ii,ii> best={{oo,1},{-1,-1}};
		int tj=-1,tk=-1;
		for (int j = 0; j < szz; ++j) { 
			for (int k = j + 1; k < szz; ++k) { 
				int rj = allw[j];
				int rk = allw[k];
				ll cost = 1ll * (sumxs[rj] + sumys[rj]) * sz[rk] + 1ll * (sumxs[rk] + sumys[rk]) * sz[rj] - 2ll * (1ll * sumx[rj] * sumx[rk] + 1ll * sumy[rj] * sumy[rk]);
				ii pr = {min(tmm[rj], tmm[rk]),max(tmm[rj],tmm[rk])};
				
			//	cout << rj << ' ' << rk << ' ' << cost << endl;
				
				if (1ll * cost * best.ff.ss < 1ll * sz[rk] * sz[rj] * best.ff.ff) { 
					best = {{cost, 1ll * sz[rk] * sz[rj]},pr};
					tj = rj;
					tk = rk;
				}
				if (1ll * cost * best.ff.ss == 1ll*sz[rk] * sz[rj] * best.ff.ff && pr < best.ss) {
					best = {{cost, 1ll * sz[rk] * sz[rj]},pr};
					tj = rj;
					tk = rk;
				}
			}
		}
	//	cout <<tj<<' ' << tk << endl;
		
	//	return 0;
		cout << sz[tj] + sz[tk] << '\n';
		uni(tj, tk);
	}
	
	return 0;
}