#include <iostream>
#include <cstring>
#include <map>
#include <cstdio>
#include <queue>
#include <algorithm>
#define ll long long
using namespace std;

const int maxn = 3000+5;

struct point
{
	ll yy, xx;
	ll x, y;
	int num;

	void show()
	{
		printf("yy:%lld y:%lld; xx:%lld x:%lld. num:%d\n",yy,y,xx,x,num);
	}
};

point poi[maxn*maxn];

struct line
{
	int a, b;
	int num;
	ll dis;
	line(int _a, int _b, ll _dis)
	{
		a = _a;
		b = _b;
		dis = _dis;
		num = poi[_a].num * poi[_b].num;
	}
};

int n;
int cnt;

template<class T>
inline void read(T &x);

void init()
{
    read(n);
	for (int i = 1; i <= n; i++)
	{
		read (poi[i].x); read(poi[i].y);
		poi[i].xx = poi[i].x * poi[i].x;
		poi[i].yy = poi[i].y * poi[i].y;
		poi[i].num = 1;
	}
	cnt = n;
}

int head, tail;
int q[maxn * maxn];
bool used[maxn*maxn];

inline ll getDis(int i, int j)
{
	ll dy = poi[i].yy * poi[j].num + poi[j].yy * poi[i].num - 2 * poi[i].y * poi[j].y;
	ll dx = poi[i].xx * poi[j].num + poi[j].xx * poi[i].num - 2 * poi[i].x * poi[j].x;

	return (dy + dx);
}

inline bool com(const line &l1, const line &l2)
{
	if (l1.dis * l2.num != l2.dis * l1.num)
		return l1.dis * l2.num  < l2.dis * l1.num;
	
	if (max(l1.a, l1.b) != max(l2.a, l2.b))
		return max(l1.a, l1.b) < max(l2.a, l2.b);

	return min(l1.a, l1.b) < min(l2.a, l2.b);
}

void work()
{
    for (int i = 1; i <= n; i++) q[i] = i;

	head = 1; tail = n;

	while (head != tail)
	{
		line Min_line(q[head], q[head+1], getDis(q[head], q[head+1]));
		for (int i = head; i <= tail; i++)
		for (int j = i + 1; j <= tail; j++)
		{
			line now(q[i], q[j], getDis(q[i],q[j]));

			if (!com(Min_line, now)) Min_line = now;
		}

		int pre_tail = tail;
		for (; head <= pre_tail; head++)
		{
			if (q[head] == Min_line.a || q[head] == Min_line.b) continue;
			q[++tail] = q[head];
		}

		// cout << Min_line.a << ' ' << Min_line.b << endl;
		cnt++;
		poi[cnt].num = poi[Min_line.a].num + poi[Min_line.b].num;
		poi[cnt].yy = poi[Min_line.a].yy + poi[Min_line.b].yy;
		poi[cnt].y = poi[Min_line.a].y + poi[Min_line.b].y;
		poi[cnt].x = poi[Min_line.a].x + poi[Min_line.b].x;
		poi[cnt].xx = poi[Min_line.a].xx + poi[Min_line.b].xx;
		// poi[cnt].show();
		q[++tail] = cnt;

		cout << poi[cnt].num << endl;
	}
}

void print()
{

}

int main()
{
 //  freopen("test.in","r",stdin);
//    freopen("test.out","w",stdout);

    init();
    work();
    print();

    return 0;
}

template<class T>
inline void read(T &x)
{
    x = 0; T s = 1;
    char c = getchar();
    while(c < '0' || c > '9') {if(c == '-') s = -1; c = getchar();}
    while(c >= '0' && c <= '9') {x = x*10+c-'0'; c = getchar();}
    x *= s;
}