#include <bits/stdc++.h>

using namespace std;
using lint = int64_t;

struct constellation{
    lint num, den;
    int i, j;
    bool operator<(const constellation& o)const {
        lint l = num * o.den, r = den * o.num;
        if(l == r) return make_pair(i, j) < make_pair(o.i, o.j);
        return l < r;
    }
};

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    cin>>n;
    vector<int>x(n), y(n);
    for(int i=0;i<n;i++) cin>>x[i]>>y[i];
    vector<int>p(2*n-1), sz(2*n-1);
    for(int i=0;i<n;i++) p[i] = i, sz[i] = 1;
    vector<lint>s2x(n), s2y(n), sx(n), sy(n);
    set<constellation>s;
    for(int i=0;i<n;i++){
        s2x[i] = x[i] * x[i];
        s2y[i] = y[i] * y[i];
        sx[i] = x[i];
        sy[i] = y[i];
    }
    for(int i=0;i<n;i++){
        for(int j=i+1;j<n;j++){
            s.insert({s2x[i] + s2x[j] + s2y[i] + s2y[j] 
            - 2 * sx[i] * sx[j] - 2 * sy[i] * sy[j],
             2, i, j});
        }
    }

    auto find = [&](auto& self, int u)->int {
        if(p[u] == u) return u;
        return p[u] = self(self, p[u]);
    };

    auto join = [&](int u, int v)->int {
        u = find(find, u);
        v = find(find, v);
        if(sz[u] < sz[v]) swap(u, v);
        p[v] = u;
        sz[u] += sz[v];

        s2x[u] += s2x[v];
        s2y[u] += s2y[v];
        sx[u] += sx[v];
        sy[u] += sy[v];
        return u;
    };

    vector<bool>w(2*n-1);

    for(int z=0;z<n-1;z++){
        auto cur = *s.begin();
        int i = find(find, cur.i), j = find(find, cur.j);
        for(int k=0;k<n+z;k++){
            if(w[k]) continue;
            int l = find(find, k);
            {
                s.erase({sz[l] * (s2x[i] + s2y[i]) + sz[i] * (s2x[l] + s2y[l]) 
                - 2 * sx[i] * sx[l] - 2 * sy[i] * sy[l],
                sz[i] + sz[l], min(cur.i, k), max(cur.i, k)});
            }
            {
                s.erase({sz[l] * (s2x[j] + s2y[j]) + sz[j] * (s2x[l] + s2y[l]) 
                - 2 * sx[j] * sx[l] - 2 * sy[j] * sy[l],
                sz[j] + sz[l], min(cur.j, k), max(cur.j, k)});
            }
        }
        w[cur.i] = w[cur.j] = 1;
        int c = join(i, j);
        for(int k=0;k<n+z;k++){
            if(w[k]) continue;
            int l = find(find, k);
            s.insert({sz[l] * (s2x[c] + s2y[c]) + sz[c] * (s2x[l] + s2y[l]) 
                - 2 * sx[c] * sx[l] - 2 * sy[c] * sy[l],
                sz[c] + sz[l], k, n + z});
        }
        p[n + z] = c;
        cout<<sz[c]<<"\n";
    }

    return 0;
}