#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
using ll = long long;
#define pb emplace_back
#define X first
#define Y second
#define AI(i) begin(i), end(i)
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true);}
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true);}
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T l, T r) { while (l != r) cerr << *l++ << " \n"[l==r]; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
#define id_t ajsdfiop

const int MAX_N = 2010;

int n;
pair<ll,ll> star[MAX_N];
struct val {
	ll u, d;
	val() : u(0), d(0) {}
	val(ll v) : u(v), d(1) {}
	val(ll u, ll d) : u(u), d(d) {}
	bool operator < (val b)const {
		// must all be non negative
		return u * b.d < d * b.u;
	}
	val operator * (val b) {
		return val(u + b.u, d + b.d);
	}
};

struct dsu {
	vector<int> g, sz;
	int F(int i) { return i == g[i] ? i : g[i] = F(g[i]); }
	void M(int a, int b) {
		a = F(a), b = F(b);
		if (a == b) return;
		if (sz[a] < sz[b]) swap(a, b);
		sz[a] += sz[b];
		g[b] = a;
	}
	int S(int i) { return sz[F(i)]; }
	dsu(int n) {
		n += 10;
		g.resize(n), sz.resize(n, 1);
		iota(AI(g), 0); 
	}
};

using tv = tuple< val, int, int > ;
val dis[MAX_N][MAX_N];
priority_queue<tv, vector<tv>, greater<tv>> pq;
ll up(ll v) { return v * v; }
ll gd(pair<ll,ll> a, pair<ll,ll> b) {
	return up(a.first-b.first) + up(a.second-b.second);
}
int t_toid[MAX_N * 2], id_t[MAX_N * 2];
int vis[MAX_N * 2];

int main() {
	ios_base::sync_with_stdio(0), cin.tie(0);
	cin >> n;
	for (int i =0 ;i < n;++i) {
		auto &[x, y] = star[i];
		cin >> x >> y;
	}
	dsu D(n);
	for (int i = 0;i < n;++i) {
		for (int j = 0;j < n;++j) {
			dis[i][j] = val(gd(star[i], star[j]), 1);
			if (i < j) pq.emplace(dis[i][j], i, j);
		}
		t_toid[i] = i;
		id_t[i] = i;
	}

	for (int t = n;t < n + n - 1;++t) {
		while (pq.size()) {
			auto [_, a, b] = pq.top(); pq.pop();
			if (vis[a] || vis[b]) continue;
			int ia = t_toid[a],
				ib = t_toid[b];
			vis[a] = vis[b] = true; 
			cout << D.S(ia) + D.S(ib) << '\n';
			D.M(ia, ib);
			int c = D.F(ia), d = ia ^ ib ^ c;
			t_toid[t] = c;
			id_t[c] = t;

			for (int i = 0;i < n;++i) {
				if (D.F(i) == i) {
					dis[c][i] = dis[i][c] = dis[i][c] * dis[i][d];
					int x = id_t[i], y = id_t[c];
					if (x != y) 
						pq.emplace(dis[i][c], min(x, y), max(x, y));
				}
			}
			break;
		}
	}
}