#include <bits/stdc++.h>
#include <set> 
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[5050], Y[5050], sz[5050], dis_[5050][5050];

struct Pair {
    int i, j;
    Pair(int _i, int _j): i(_i), j(_j) {}
    bool operator < (const Pair &o) const {
        LLL tmp1 = dis_[i][j] * sz[o.i] * sz[o.j];
        LLL tmp2 = dis_[o.i][o.j] * sz[i] * sz[j];
        if(tmp1 == tmp2) {
            if(j == o.j) return i < o.i;
            else return j < o.j;
        }
        else return tmp1 < tmp2;
    }
};

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

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