#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;
// const double eps = 1e-8;
LL dist[N][N];
int n;
PII point[N];
int sz[N], year[N]; // year越小越老
// int dcmp(double a, double b)
// {
//     if (fabs(a - b) < eps)
//         return 0;
//     if (a < b)
//         return -1;
//     return 1;
// }
LL get_dist(PII a, PII b)
{
    int dx = a.x - b.x, dy = a.y - b.y;
    // return sqrt(dx * dx + dy * dy);
    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++)
        sz[i] = 1;
    for (int i = 1; i <= n; i++)
    {
        int x, y;
        cin >> x >> y;
        point[i] = {x, y};
        year[i] = i;
    }
    int stand = n;
    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]);
    vector<int> num;
    for (int i = 1; i <= n; i++)
        num.push_back(i);
    for (int k = 1; k < n; k++)
    {
        PII t = {-1, -1}; // 存位置
        double minv = 1e18;
        for (int i = 0; i < num.size(); i++)
            for (int j = i + 1; j < num.size(); j++)
            {
                int a = num[i], b = num[j];
                if (year[a] < year[b])
                    swap(a, b);
                if (t.x == -1 || minv * (sz[a] + sz[b]) > dist[a][b] * (sz[num[t.x]] + sz[num[t.y]]) || minv * (sz[a] + sz[b]) == dist[a][b] * (sz[num[t.x]] + sz[num[t.y]]) && (year[num[t.x]] > year[a] || year[num[t.x]] == year[a] && year[num[t.y]] < year[b]))
                    t = {i, j}, minv = dist[a][b];
            }
        for (int i = 0; i < num.size(); i++)
        {
            if (i == t.x || i == t.y)
                continue;
            int x = num[t.x], y = num[t.y];
            int a = num[i];
            dist[x][a] = dist[a][x] = (dist[x][a] * sz[x] + dist[y][a] * sz[y]); // / (sz[x] + sz[y]);
        }
        sz[num[t.x]] += sz[num[t.y]], sz[num[t.y]] = 0;
        year[num[t.x]] = ++stand;
        cout << sz[num[t.x]] << endl;
        num.erase(num.begin() + t.y);
    }
    return 0;
}