#include <bits/stdc++.h>
using namespace std;
int n;
int x[100005], y[100005];
struct node {
    long long sz;
    long long x;
    long long x2;
    long long y;
    long long y2;
    
};
struct frac {
    long long x, y;
    bool operator<(const frac& rhs) const
    {
        return (__int128)x * rhs.y < (__int128)y * rhs.x;
    }
};
frac merge(node x, node y)
{
    frac t;
    t.y = x.sz * y.sz;
    t.x = x.sz * y.x2 + x.sz * y.y2 + y.sz * x.x2 + y.sz * x.y2 - 2 * x.x * y.x - 2 * x.y * y.y;
    return t;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    vector<node> now(2 * n + 5);
    for (int i = 1; i <= n; ++i) {
        cin >> x[i] >> y[i];
        now[i] = { 1, x[i], x[i] * x[i], y[i], y[i] * y[i] };
    }
    vector<bool> vis(2 * n + 5, 0);
    priority_queue<tuple<frac, int, int>, vector<tuple<frac, int, int>>, greater<>> que;
    for (int i = 1; i <= n; ++i) {
        for (int j = i + 1; j <= n; ++j) {
            que.push({merge(now[i],now[j]),i,j});
        }
    }
    int tot = n;
    while(!que.empty()){
        auto [d, x, y] = que.top();
        que.pop();
        if(vis[x]||vis[y])
            continue;
        vis[x] = 1;
        vis[y] = 1;
        tot++;
        now[tot]= {now[x].sz + now[y].sz, now[x].x + now[y].x, now[x].x2 + now[y].x2, now[x].y + now[y].y, now[x].y2 + now[y].y2};
        cout << now[tot].sz << '\n';
        for (int i = 1; i < tot;++i){
            if(!vis[i])
                que.push({merge(now[tot], now[i]), i, tot});
        }
    }
}