#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("O3")

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#ifdef APURBA
#include "DEBUG_TEMPLATE.h"
#else
#define HERE
#define debug(args...)
#endif
#define ALL(x) x.begin(),x.end()

int cnt;
struct Data
{
    ll x,x2,y,y2,n,id;
};
Data comb(Data a, Data b)
{
    return {a.x+b.x, a.x2+b.x2, a.y +b.y , a.y2 + b.y2, a.n+b.n, cnt++};
}

struct Data2
{
    ll up,down,mx,smx,i,j;
    bool operator < (Data2 const & d) const
    {
        if(up*d.down == d.up * down)
        {

            return make_pair(mx,smx) < make_pair(d.mx,d.smx);
        }
        else
        {
            return up*d.down < d.up * down;
        }
    }
};

void TEST_CASES()
{
    int n;
    cin>>n;
    vector<Data> a;
    for(int i=0;i<n;i++)
    {
        int x,y;
        cin>>x>>y;
        a.push_back({x,x*x,y,y*y,1,cnt++});
    }
    for(int i=0;i<n-1;i++)
    {
        bool ok=0;
        Data2 x;
        int nn=a.size();
        for(int j=0;j<nn;j++)
        {
            for(int k=j+1;k<nn;k++)
            {
                Data2 y = {
                    a[j].x2*a[k].n + a[j].y2*a[k].n
                    +a[k].x2*a[j].n + a[k].y2*a[j].n
                    -2*a[j].x*a[k].x
                    -2*a[j].y*a[k].y
                    ,
                    a[j].n*a[k].n
                    ,
                    min(a[j].id,a[k].id)
                    ,
                    max(a[j].id,a[k].id)
                    ,
                    j
                    ,
                    k
                    };

                if(ok)
                {
                    x=min(x,y);

                }
                else
                {
                    x=y;
                    ok=1;
                }
            }
        }
        int j=x.i;
        int k=x.j;
        debug(j,k);
        if(k!=nn-1)
        {
            swap(a[k],a[nn-1]);
            k=nn-1;
        }
        if(j!=nn-2)
        {
            swap(a[j],a[nn-2]);
            j=nn-2;
        }
        Data q = a.back();
        a.pop_back();
        Data w = a.back();
        a.pop_back();
        auto e = comb(q,w);
        cout<<e.n<<"\n";
        a.push_back(e);
    }

}


/*
*/

int32_t main()
{
#ifndef APURBA
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#endif
    //freopen("input.txt","r",stdin);
    //freopen("out1.txt","w",stdout);
    int t=1;
    //cin>>t;
    while(t--)
    {
        TEST_CASES();
    }
    return 0;
}