#include<bits/stdc++.h>
using namespace std;

#define int long long

const int N=4e3+1e2+7;

int n,sx[N],sy[N],sxx[N],syy[N],c[N],x[N],y[N];

int cald(int a,int b)
{
    return sxx[a]+sxx[b]-2*sx[a]*sx[b]+syy[a]+syy[b]-2*sy[a]*sy[b];
}

int fa[N];

int find(int x)
{
    return x==fa[x]?x:fa[x]=find(fa[x]);
}

struct ND{
    int x,y;
    int A,B;
};

bool operator <(const ND &a,const ND &b)
{
    if(a.A*b.B!=b.A*a.B)
        return a.A*b.B>b.A*a.B;
    if(a.x!=b.x)
        return a.x>b.x;
    return a.y>b.y;
}

priority_queue<ND>q;

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>x[i]>>y[i],fa[i]=i,sx[i]=x[i],sy[i]=y[i],sxx[i]=x[i]*x[i],syy[i]=y[i]*y[i],c[i]=1;
    
    for(int i=1;i<=n;i++)
        for(int j=i+1;j<=n;j++)
            q.push({i,j,cald(i,j),c[i]*c[j]});
    int t=n;
    while(!q.empty())
    {
        auto [x,y,A,B]=q.top();
        q.pop();
        if(find(x)!=x||find(y)!=y)
            continue;
        ++t;
        fa[x]=t,fa[y]=t;
        fa[t]=t;
        c[t]=c[x]+c[y];
        sx[t]=sx[x]+sx[y];
        sy[t]=sy[x]+sy[y];
        sxx[t]=sxx[x]+sxx[y];
        syy[t]=syy[x]+syy[y];
        cout<<c[t]<<"\n";
        for(int i=1;i<t;i++)
            if(find(i)==i)
                q.push({i,t,cald(i,t),c[i]*c[t]});
    }
}