#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <iomanip>

using namespace std;

const int N = 4000 + 5, inf = 1e9;
#define pb push_back
#define mp make_pair
#define ll long long
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define sz(x) (int)x.size()
typedef vector<int> vi;
typedef pair<int,int> ii;
typedef vector<ii> vii;

struct Dat {
    ll dis;
    int d;
    int mn, mx;
    Dat(ll dis, int d, int mn, int mx){
        this->dis = dis;
        this->d = d;
        this->mn = mn;
        this->mx = mx;
    }
    bool operator<(const Dat &b) const{
        return (dis * b.d != b.dis * d) ? (dis * b.d < b.dis * d) : (mn != b.mn) ? mn < b.mn : mx < b.mx;
    }
    bool operator>(const Dat &b) const{
        return (b < *this);
    }
};

ll a[N][N];
int sz[N];

void solve(){
    int n;
    cin >> n;
    vi x(n), y(n);

    for(int i = 0; i < n; i++){
        cin >> x[i] >> y[i];
    }
    priority_queue<Dat, vector<Dat>, greater<Dat>> pq;
    for(int i = 0; i < n; i++){
        for(int j = i + 1; j < n; j++){
            ll d = abs(x[i] - x[j]) * abs(x[i] - x[j]) + abs(y[i] - y[j]) * abs(y[i] - y[j]);
            a[i][j] = a[j][i] = d;
            pq.push(Dat(d, 1, i, j));
        }
    }
    for(int i = 0; i < n; i++){
        sz[i] = 1;
    }
    int cur = n;
    while(!pq.empty()){
        auto x = pq.top(); pq.pop();
        if(sz[x.mn] == 0 || sz[x.mx] == 0)continue;
        sz[cur] += sz[x.mn] + sz[x.mx];
        sz[x.mn] = sz[x.mx] = 0;
        cout << sz[cur] << '\n';
        for(int i = 0; i < cur; i++){
            if(sz[i] == 0)continue;
            a[cur][i] = a[i][cur] = a[x.mn][i] + a[x.mx][i];
            pq.push(Dat(a[cur][i], sz[cur] * sz[i], i, cur));
        }
        cur++;
    }
}

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int t = 1;
    // cin >> t;
    while(t--){
        solve();
    }
    return 0;
}