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

using ll = long long;
using ld = long double;
using pl = pair<ll, ll>;
using vl = vector<ll>;

#define f first
#define s second

ll sq(ll x) {return x * x;}
ll dist(pl a, pl b) {
    return sq(a.f - b.f) + sq(a.s - b.s);
}

ll act[4005];
ll sz[4005];
ll dv[4005][4005];

ll gv(ll x, ll y) {
    if (x > y) swap(x, y);
    return dv[x][y];
}


bool cmp ( pair<ll, pair<short, short>> a,  pair<ll, pair<short, short>> b) {
        ll sa = sz[a.s.f] * sz[a.s.s];
        ll sb = sz[b.s.f] * sz[b.s.s];

        // cout << "CA " << a.s.f << " " << a.s.s << " " << sa << endl;
        // cout << "CB " << b.s.f << " " << b.s.s << " " << sb << endl;

        if (a.f * sb == b.f * sa) {
            return a.s < b.s;
        } 
        return a.f * sb < b.f * sa;
    }

int main() {
    ll n; cin >> n;
    vector<pl> v(n);
    for (pl &x: v) cin >> x.f >> x.s;

    for (ll i = 0; i < n; i++) {
        act[i] = 1;
        sz[i] = 1;
    }

    set<pair<ll, pair<short, short>>, decltype(cmp)*> st(cmp);
    for (ll i = 0; i < n; i++) {
        for (ll j = i + 1; j < n; j++) {
            dv[i][j] = dist(v[i], v[j]);
            // cout << i << " " << j << " " << dv[i][j] << '\n';
            st.insert({dv[i][j], {(short)i, (short)j}});
        }
    }

    

    ll pt = n;
    vl ans;
    while (st.size()) {
        auto [d, p] = *st.begin();
        auto [i, j] = p;
        st.erase(st.begin());
        // cout << d << " " << i << " " << j << " " << sz[i] << " " << sz[j] << '\n';
        if (!act[i] || !act[j]) continue;
        // cout << "A " << d << " " << i << " " << j << " " << sz[i] << " " << sz[j] << '\n';

        sz[pt] = sz[i] + sz[j];
        act[i] = act[j] = 0;
        act[pt] = 1;
        ans.push_back(sz[pt]);
        for (ll k = 0; k < pt; k++) {
            dv[k][pt] = gv(k, i) + gv(k, j);
            if (act[k]) {
                st.insert({dv[k][pt],{(short)k, (short)pt}});
            }
        }
        ++pt;
    }
    for (ll x: ans) cout << x << '\n';
}