#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#define x first
#define y second
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 2e3 + 10, M = N * N;
int n, idx;
bool st[N * 2];
int sz[N * 2];
PII point[N];
LL dist[2 * N][2 * N];
typedef struct Node
{
    int u, v;
    bool operator<(const Node &t) const
    {
        LL res1 = dist[u][v] * sz[t.u] * sz[t.v];
        LL res2 = dist[t.u][t.v] * sz[u] * sz[v];
        if (res1 != res2)
            return res1 < res2;
        return u != t.u ? u < t.u : v < t.v;
    }
    bool operator>(const Node &t) const
    {
        return (*this) < t;
    }
} Node;
LL get_dist(PII a, PII b)
{
    int dx = a.x - b.x, dy = a.y - b.y;
    return dx * dx + dy * dy;
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        int x, y;
        cin >> x >> y;
        point[i] = {x, y};
        sz[i] = 1;
    }
    idx = n;
    priority_queue<Node, vector<Node>, greater<Node>> heap;
    for (int i = 1; i <= n; i++)
        for (int j = i + 1; j <= n; j++)
            dist[i][j] = dist[j][i] = get_dist(point[i], point[j]), heap.push({i, j});
    while (heap.size())
    {
        Node t = heap.top();
        heap.pop();
        if (st[t.u] || st[t.v])
            continue;
        st[t.u] = 1, st[t.v] = 1;
        int x = ++idx;
        sz[x] = sz[t.u] + sz[t.v];
        for (int i = 1; i < idx; i++)
        {
            if (st[i])
                continue;
            dist[x][i] = dist[i][x] = dist[t.u][i] + dist[t.v][i];
            heap.push({i, x});
        }
        cout << sz[x] << endl;
    }
    return 0;
}