#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 {
        int thisnew = max(i, j), thisold = min(i, j);
        int othernew = max(o.i, o.j), otherold = min(o.i, o.j);
        
        LL tmp1 = dis_[i][j] * sz[o.i] * sz[o.j];
        LL tmp2 = dis_[o.i][o.j] * sz[i] * sz[j];
        
//        cout << tmp1 << ' ' << tmp2 << ' ' << thisold << ' ' << otherold << ' ' << thisnew << ' ' << othernew << endl;
        
        if(tmp1 == tmp2) {
            if(thisold == otherold) return thisnew < othernew;
            else return thisold < otherold;
        }
        else return tmp1 < tmp2;
    }
};

set<Pair> s[4050];
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) {
            if(i == j) continue;
            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);
        sz[i] = 1;
    }
    
    while(exist.size() > 1) {
        if(n > 100) break;
        
//        cout << "exist: ";
//        for(int i: exist) cout << i << ' ';
//        cout << endl;
//        for(int i: exist) {
//            for(Pair pair: s[i]) {
//                int j = pair.j;
//                cout << 1.0 * dis_[i][j] / sz[i] / sz[j] << ' ';
//            }
//            cout << endl;
//        }
//        cout << endl;
//        
//        cout << "dis: " << endl;
//        for(int i: exist) {
//            for(int j: exist) {
//                if(i == j) cout << "0 ";
//                else cout << 1.0 * dis_[i][j] / sz[i] / sz[j] << ' ';
//            }
//            cout << endl;
//        }
        
        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;
        
        sz[++n] = sz[id1] + sz[id2];
        for(int i: exist) {
            if(i == id1 || i == id2) continue;
            dis_[i][n] = dis_[n][i] = dis_[i][id1] + dis_[i][id2];
        }
        
        for(int i: exist) {
            if(i != id1) {
//                int sss = s[i].size();
                s[i].erase(s[i].lower_bound(Pair(i, id1)));
//                cout << "delta: " << sss - s[i].size() << ' ' << i << ' ' << id1 << endl;
            }
            if(i != id2) {
//                int sss = s[i].size();
                s[i].erase(s[i].lower_bound(Pair(i, id2)));
//                cout << "delta: " << sss - s[i].size() << ' ' << i << ' ' << id2 << endl;
            }
            if(i != id1 && i != id2) s[i].insert(Pair(i, n)), s[n].insert(Pair(n, i));
        }
        
//        cout << id1 << ' ' << id2 << " -> " << n << endl;
        exist.erase(id1), exist.erase(id2);
        exist.insert(n);
        
        printf("%lld\n", sz[n]);
    }
    return 0;
}