#include <bits/stdc++.h>
using namespace std;
const double eps=1e-6;
typedef __int128 ll;
struct frac{
	double p;
	inline frac(){p=0;}
	inline frac(ll x){p=x;}
	frac operator + (const frac &x)const{return p+x.p;}
	frac operator - (const frac &x)const{return p-x.p;}
	frac operator * (const frac &x)const{return p*x.p;}
	frac operator / (const frac &x)const{return p/x.p;}
	bool operator < (const frac &x)const{return p<x.p-eps;}
};
struct point{
	frac x,y;
	point operator + (const point &k)const{return (point){x+k.x,y+k.y};}
	point operator - (const point &k)const{return (point){x-k.x,y-k.y};}
	point operator * (const frac &k)const{return (point){x*k,y*k};}
	point operator / (const frac &k)const{return (point){x/k,y/k};}
	frac abs2()const{return x*x+y*y;}
	frac dis2(const point &k)const{return ((*this)-k).abs2();}
};

const int maxn=6000;

int n;
point a[maxn+50];
int sz[maxn+50];

int main(){
	ios_base::sync_with_stdio(false);
	cin >> n;
	for (int i=1;i<=n;i++){
		int x,y;
		cin >> x >> y;
		a[i]=(point){frac(x),frac(y)};	
	}
	set<tuple<frac,int,int>> s;
	for (int i=1;i<=n;i++) sz[i]=1;
	int id=n;
	for (int i=1;i<=n;i++){
		for (int j=i+1;j<=n;j++){
			s.emplace(a[i].dis2(a[j]),i,j);	
		}
	}
	for (;;){
		if (s.empty()) break;
		
		auto tmp=*(s.begin());
		int x=get<1>(tmp);
		int y=get<2>(tmp);
		sz[++id]=sz[x]+sz[y];
		a[id]=(a[x]*sz[x]+a[y]*sz[y])/(sz[x]+sz[y]);
		
	//	cerr << "merge : " << id << " " << x << " " << y << " " << sz[x] << " " << sz[y] << endl;
		
		for (int i=1;i<id;i++) if (sz[i]!=0){
			int l=i,r=x;
			if (l>r) swap(l,r);
			if (l==r) continue;
			auto it=s.find(make_tuple(a[l].dis2(a[r]),l,r));
			if (it!=s.end()) s.erase(it);
		}
		sz[x]=0;
		for (int i=1;i<id;i++) if (sz[i]!=0){
			int l=i,r=y;
			if (l>r) swap(l,r);
			if (l==r) continue;
			auto it=s.find(make_tuple(a[l].dis2(a[r]),l,r));
			if (it!=s.end()) s.erase(it);
		}
		sz[y]=0;
		
		for (int i=1;i<id;i++) if (sz[i]!=0){
			s.emplace(a[i].dis2(a[id]),i,id);
		}
		cout << sz[id] << "\n";
	}
	return 0;
}