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

struct Pt{
    int x, y;
    Pt operator-(const Pt &b)const{return Pt{x-b.x, y-b.y};}
    int len2()const{return x*x+y*y;}
};

const int N = 4005;
int n;
Pt pt[N];
int dis[N][N], sz[N], tot;
bool del[N];

struct Node{
    int u, v;
    bool operator>(const Node &b)const{
        int res1 = dis[u][v] * sz[b.u]*sz[b.v];
        int res2 = dis[b.u][b.v] * sz[u]*sz[v];
        if (res1 != res2) return res1 < res2;
        else return (u!=b.u ? u<b.u : v<b.v); 
    }
    bool operator<(const Node &b)const{return b > (*this);}
};

signed main(){
    ios::sync_with_stdio(0); cin.tie(0);
    cin >> n;
    tot = n;
    for (int i=1; i<=n; ++i){
        cin >> pt[i].x >> pt[i].y;
        sz[i] = 1;
    }
    priority_queue<Node> Q;
    for (int i=1; i<=n; ++i) for (int j=i+1; j<=n; ++j) dis[i][j] = dis[j][i] = (pt[i]-pt[j]).len2();
    for (int i=1; i<=n; ++i) for (int j=i+1; j<=n; ++j) Q.push(Node{i, j});
    while (!Q.empty()){
        auto [u, v] = Q.top(); Q.pop();
        if (del[u] || del[v]) continue;
        del[u] = del[v] = true;
        int x = ++tot;
        sz[x] = sz[u]+sz[v];
        for (int i=1; i<tot; ++i) if (!del[i]) {
            dis[i][x] = dis[x][i] = dis[u][i]+dis[v][i];
            Q.push(Node{i, x});
        }
        cout << sz[x] << '\n';
    }

    return 0;
}