#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;++i)
#define pb push_back
#define mp make_pair
#define stack stck  
pair<long long,long long> p[4100];
long long cnt[4100],v[4100];
long long d[4100][4100];
int n;
struct node
{
    long long sum,cnt;
    int x,y;
    friend bool operator <(node a,node b)
    {
        if (a.sum*b.cnt!=b.sum*a.cnt)
            return a.sum*b.cnt>b.sum*a.cnt;
        if (a.x!=b.x)return a.x>b.x;
        return a.y>b.y;
    }
};
priority_queue<node> Q;
int main()
{
    cin>>n;
    rep(i,n)scanf("%lld%lld",&p[i].first,&p[i].second);
    rep(i,n)cnt[i]=1;
    rep(i,n)
    for(int j=i+1;j<=n;j++)
    {
        d[i][j]=d[j][i]=
        (p[i].first-p[j].first)*(p[i].first-p[j].first)+
        (p[i].second-p[j].second)*(p[i].second-p[j].second);
        Q.push((node){d[i][j],1,i,j});
    }
    int tot=n;
    int ti=0;
    while (ti<n-1)
    {
        auto t=Q.top(); Q.pop();
        if (v[t.x]||v[t.y])continue;
        ti++;

        ++tot;
        cnt[tot]=cnt[t.x]+cnt[t.y];
        v[t.x]=1;
        v[t.y]=1;
        printf("%d\n",cnt[tot]);

        for(int i=1;i<tot;i++)
        {
            if (v[i])continue;
            d[i][tot]=d[tot][i]=d[i][t.x]+d[i][t.y];
            Q.push((node){d[i][tot],cnt[i]*cnt[tot],i,tot});
        }
    }
    return 0;
}