#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int N = 2000 + 3;

struct Fraction{
	ll a, b;
	friend bool operator<(const Fraction &l, const Fraction &r){
		return (__int128)l.a * r.b < (__int128)r.a * l.b;
	}
};

int n;
array<ll, 3> p[2 * N];
ll sum[2 * N][2 * N];
ll sz[2 * N];
set<pair<Fraction, pair<int, int>>> s;
set<int> active;
int cnt;

ll dist2(ll x1, ll y1, ll x2, ll y2){
	return (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
}

void merge(int u, int v){
	if(u > v)
		swap(u, v);

	// cout << u << " " << v << " u v" << endl;

	int nw = cnt++;

	active.erase(u);
	active.erase(v);
	sz[nw] = sz[u] + sz[v];

	for(int x: active){
		sum[x][nw] = sum[min(x, u)][max(x, u)] + sum[min(x, v)][max(x, v)];
		s.insert({Fraction{sum[x][nw], sz[x] * sz[nw]}, pair<int, int>{x, nw}});
		s.erase({Fraction{sum[min(x, u)][max(x,u)], sz[x] * sz[u]}, pair<int, int>{min(x, u), max(x, u)}});
		s.erase({Fraction{sum[min(x, v)][max(x,v)], sz[x] * sz[v]}, pair<int, int>{min(x, v), max(x, v)}});
	}
	s.erase({Fraction{sum[u][v], sz[u] * sz[v]}, pair<int, int>{u, v}});
	active.insert(nw);

	/*cout << nw << " nw" << endl;
	cout << "sss:" << endl;
	for(auto [f, p]: s){
		cout << f.a << " " << f.b << " - " << p.first << " " << p.second << endl;
	}
	*/
	cout << sz[nw] << "\n";
}

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

	cin >> n;
	for(int i = 0; i < n; ++i){
		cin >> p[i][0] >> p[i][1];
		p[i][2] = i;
		sz[i] = 1;
		active.insert(i);
	}

	for(int i = 0; i < n; ++i){
		for(int j = i + 1; j < n; ++j){
			ll d = dist2(p[i][0], p[i][1], p[j][0], p[j][1]);
			sum[i][j] = d;
			s.insert({Fraction{d, 1}, pair<int, int>{i, j}});
		}
	}

	cnt = n;
	while(cnt < 2 * n - 1){
		auto best = *s.begin();
		s.erase(s.begin());
		merge(best.second.first, best.second.second);
	}
}