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

typedef long long LL;
typedef unsigned long long ULL;
//typedef __int128 LLL;

int read() {
    int x = 0, f = 1; char c = getchar();
    while(c < '0' || c > '9') c == '-' ? f = -1: 0, c = getchar();
	while(c >= '0' && c <= '9') x = (x << 1) + (x << 3) + (c ^ '0'), c = getchar();
    return x * f;
}

LL X[2050], Y[2050];
double dis[4050][4050];
LL dis_[4050][4050];
int size[4050];

struct Pair {
    int i, j;
    Pair(int _i, int _j) {i = _i, j = _j;}
    bool operator < (const Pair &o) const {
        
        int thisnew = min(i, j), thisold = max(i, j);
        int othernew = min(o.i, o.j), otherold = max(o.i, o.j);
        
        if(dis[i][j] == dis[o.i][o.j])
            return thisold == otherold ? thisnew > othernew : thisold > otherold;
        else return dis[i][j] < dis[o.i][o.j];
    }
};

set<Pair> s[4050];
set<int> exist;

signed main() {
    int n = read();
    for(int i = 1; i <= n; ++i) X[n - i + 1] = read(), Y[n - i + 1] = read();
    for(int i = 1; i <= n; ++i) {
        for(int j = 1; j <= n; ++j) {
            if(i == j) continue;
            dis[i][j] = dis_[i][j] = (X[i] - X[j]) * (X[i] - X[j]) + (Y[i] - Y[j]) * (Y[i] - Y[j]);
            s[i].insert(Pair(i, j));
        }
        exist.insert(i);
        size[i] = 1;
    }
    
    while(exist.size() > 1) {
        Pair mn = *s[*exist.begin()].begin();
        
        for(int i: exist) {
            Pair pair = *(s[i].begin());
            if(pair < mn) mn = pair;
        }
        int id1 = mn.i, id2 = mn.j;
        
        size[++n] = size[id1] + size[id2];        
        for(int i: exist) {
            if(i == id1 || i == id2) continue;
            dis_[i][n] = dis_[n][i] = dis_[i][id1] + dis_[i][id2];
            dis[i][n] = dis[n][i] = 1.0 * dis_[i][n] / size[i] / size[n];
        }
        
        for(int i: exist) {
            if(i != id1) s[i].erase(Pair(i, id1));
            if(i != id2) s[i].erase(Pair(i, id2));
            if(i != id1 && i != id2) s[i].insert(Pair(i, n)), s[n].insert(Pair(n, i));
        }
        
        exist.erase(id1), exist.erase(id2);
        exist.insert(n);
        
        printf("%d\n", size[n]);
    }
    return 0;
}