// Hallelujah, praise the one who set me free
// Hallelujah, death has lost its grip on me
// You have broken every chain, There's salvation in your name
// Jesus Christ, my living hope
#include <bits/stdc++.h> 
using namespace std;

#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;

#ifndef DEBUG
#define cerr if (0) cerr
#endif

const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 4005;

struct star {
    ll x2, x1, y2, y1;
    int c, age;
    star operator+ (const star &o) const {
        return {x2 + o.x2, x1 + o.x1, y2 + o.y2, y1 + o.y1, c + o.c, 0};
    }
};

struct delta {
    ll num, denom;
    int mnage, mxage;
    delta(star a, star b) {
        num = a.x2 * b.c - 2 * a.x1 * b.x1 + a.c * b.x2 +
            a.y2 * b.c - 2 * a.y1 * b.y1 + a.c * b.y2;
        denom = a.c * b.c;
        mnage = min(a.age, b.age);
        mxage = max(a.age, b.age);
    }
    bool operator> (const delta &o) const {
        if (num * o.denom == o.num * denom) {
            if (mnage == o.mnage) {
                return mxage > o.mxage;
            }
            return mnage > o.mnage;
        }
        return num * o.denom > o.num * denom;
    }
};

int n;
vector<star> stars;
priority_queue<delta, vector<delta>, greater<delta>> pq;
bool dead[MAXN];

int main() {
#ifndef DEBUG
    ios::sync_with_stdio(0), cin.tie(0);
#endif
    cin >> n;
    stars = vector<star>(n);
    REP (i, 0, n) {
        ll x, y; cin >> x >> y;
        stars[i] = {x * x, x, y * y, y, 1, i};
    }
    REP (i, 0, n) {
        REP (j, i + 1, n) {
            pq.push(delta(stars[i], stars[j]));
            delta td = delta(stars[i], stars[j]);
            cerr << i << ' ' << j << ": " << td.num << " / " << td.denom << '\n';
        }
    }
    while (!pq.empty()) {
        delta top = pq.top(); pq.pop();
        int u = top.mnage, v = top.mxage;
        if (dead[u] || dead[v]) {
            continue;
        }
        cerr << u << ' ' << v << '\n';
        dead[u] = 1; dead[v] = 1;
        star nstar = stars[u] + stars[v];
        nstar.age = SZ(stars);
        for (star s : stars) {
            if (dead[s.age]) {
                continue;
            }
            pq.push(delta(s, nstar));
            delta td = delta(s, nstar);
            cerr << s.age << ' ' << nstar.age << ": " << td.num << " / " << td.denom << '\n';
        }
        stars.pb(nstar);
        cout << nstar.c << '\n';
    }
}