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

struct Clln {
    int ind;
    ll sqr, sumx, sumy;
    int sz;
    bool operator< (const Clln &o) const {
        return ind < o.ind;
    }

    pair<ll, ll> dist_to(const Clln &o) {
        return {sqr + o.sqr - 2*sumx*o.sumx - 2*sumy*o.sumy, sz * o.sz};
    }
};

vector<Clln> cllns;

struct Dist {
    pair<ll, ll> d; int ai, bi;
    bool operator< (const Dist &o) const {
        if (d.first * o.d.second == o.d.first * d.second) {
            if (min(ai, bi) == min(o.ai, o.bi)) {
                return max(ai, bi) > max(o.ai, o.bi);
            }
            return min(ai, bi) > min(o.ai, o.bi);
        }
        return d.first * o.d.second > o.d.first * d.second;
    }
};

int main() {
    int n; cin >> n;
    cllns = vector<Clln>(2*n+1, { -1, 0, 0, 0, 0 });
    priority_queue<Dist> dsts;
    vector<bool> used(2*n+1);
    for (int i = 0; i < n; i++) {
        ll x, y; cin >> x >> y;
        Clln c = { i, (x*x + y*y), x, y, 1 };
        cllns[i] = c;
        for (Clln &o : cllns) {
            if (o.ind == -1 || o.ind == i) continue;
            Dist dd = { c.dist_to(o), o.ind, i };
            dsts.push(dd);
        }
    }

    int ci = n;

    while (!dsts.empty()) {
        Dist cd = dsts.top(); dsts.pop();
        if (used[cd.ai] || used[cd.bi]) continue;
        cout << (cllns[cd.ai].sz + cllns[cd.bi].sz) << '\n';

        Clln nc = { 
            ci,
            cllns[cd.ai].sqr + cllns[cd.bi].sqr,
            cllns[cd.ai].sumx + cllns[cd.bi].sumx,
            cllns[cd.ai].sumy + cllns[cd.bi].sumy,
            cllns[cd.ai].sz + cllns[cd.bi].sz,
        };
        cllns[ci] = nc;
        ci++;
        used[cd.ai] = used[cd.bi] = 1;

        for (Clln &o : cllns) {
            if (o.ind == -1 || o.ind == nc.ind || used[o.ind]) continue;
            Dist dd = { nc.dist_to(o), o.ind, nc.ind };
            dsts.push(dd);
        }
    }
}