#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int N = 4e3 + 5;
int n, x[N], y[N], sz[N], fa[N];
ll ds[N][N];
int find(int x) {return fa[x] == x ? x : fa[x] = find(fa[x]);}
struct node {
  ll sum;
  int x, y;
  bool operator < (const node &z) const {
    ll L = sum * sz[z.x] * sz[z.y];
    ll R = z.sum * sz[x] * sz[y];
    if(L != R) return L > R;
    if(x != z.x) return x > z.x;
    return y > z.y;
  }
};
priority_queue<node> q;

int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  #ifdef ALEX_WEI
    FILE* IN = freopen("1.in", "r", stdin);
    FILE* OUT = freopen("1.out", "w", stdout);
  #endif
  cin >> n;
  for(int i = 1; i <= n; i++) cin >> x[i] >> y[i], fa[i] = i, sz[i] = 1;
  for(int i = 1; i <= n; i++)
    for(int j = i + 1; j <= n; j++) {
      ds[i][j] = ds[j][i] = (x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]);
      q.push({ds[i][j], i, j});
    }
  for(int _ = 1; _ < n; _++) {
    int c = n + _;
    while(1) {
      node t = q.top();
      q.pop();
      if(find(t.x) != t.x) continue;
      if(find(t.y) != t.y) continue;
      fa[t.x] = fa[t.y] = fa[c] = c;
      sz[c] = sz[t.x] + sz[t.y];
      cout << sz[c] << "\n";
      for(int p = 1; p < c; p++) {
        ds[p][c] = ds[c][p] = ds[t.x][p] + ds[t.y][p];
        if(find(p) == p) q.push({ds[p][c], p, c});
      }
      break;
    }
  }
  cerr << 1e3 * clock() / CLOCKS_PER_SEC << " ms\n";
  return 0;
}
/*
g++ C.cpp -o C -std=c++14 -O2 -DALEX_WEI
*/