#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


int N;
vector<Int> X, Y;

Int dist[4010][4010];

struct Entry {
  Int p, q;
  int u, v;
  bool operator<(const Entry &o) const {
    return ((p * o.q != o.p * q) ? (p * o.q < o.p * q) : (u != o.u) ? (u < o.u) : (v < o.v));
  };
  bool operator>(const Entry &o) const {
    return (o < *this);
  }
};

int main() {
  for (; ~scanf("%d", &N); ) {
    X.resize(N);
    Y.resize(N);
    for (int u = 0; u < N; ++u) {
      scanf("%lld%lld", &X[u], &Y[u]);
    }
    
    vector<int> sz(2 * N - 1);
    for (int u = 0; u < N; ++u) {
      sz[u] = 1;
    }
    memset(dist, 0, sizeof(dist));
    for (int u = 0; u < N; ++u) for (int v = u + 1; v < N; ++v) {
      dist[u][v] = dist[v][u] = (X[u] - X[v]) * (X[u] - X[v]) + (Y[u] - Y[v]) * (Y[u] - Y[v]);
    }
    
    priority_queue<Entry, vector<Entry>, greater<Entry>> que;
    for (int u = 0; u < N; ++u) for (int v = u + 1; v < N; ++v) {
      que.push(Entry{dist[u][v], 1, u, v});
    }
    for (int w = N; w < 2 * N - 1; ++w) {
      for (; ; ) {
        const int u = que.top().u;
        const int v = que.top().v;
        que.pop();
        if (sz[u] && sz[v]) {
// cerr<<"merge "<<u<<" "<<v<<endl;
          sz[w] = sz[u] + sz[v];
          sz[u] = sz[v] = 0;
          printf("%d\n", sz[w]);
          for (int x = 0; x < w; ++x) if (sz[x]) {
            dist[x][w] = dist[w][x] = dist[u][x] + dist[v][x];
            que.push(Entry{dist[x][w], sz[x] * sz[w], x, w});
          }
          break;
        }
      }
    }
#ifdef LOCAL
cerr<<"========"<<endl;
#endif
  }
  return 0;
}