#include <bits/stdc++.h>
using namespace std;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int64_t a, b, c;
  int n;
  cin >> n;
  vector<int64_t> px(n), py(n);
  int64_t lx, ly, ux, uy;
  lx = ly = INT_MAX;
  ux = uy = INT_MIN;
  for (int i = 0; i < n; ++i) {
    cin >> px[i] >> py[i];
    lx = min(lx, px[i]);
    ly = min(ly, py[i]);
    ux = max(ux, px[i]);
    uy = max(uy, py[i]);
  }
  int64_t ap = 2 * (ux - lx + uy - ly);
  int64_t p = 0;
  auto get_p = [&](int a, int b, int c) {
    lx = min(px[a], min(px[b], px[c]));
    ly = min(py[a], min(py[b], py[c]));
    ux = max(px[a], max(px[b], px[c]));
    uy = max(py[a], max(py[b], py[c]));
    return 2 * (ux - lx + uy - ly);
  };
  int ext[4];
  for (int i = 0; i < n; ++i) {
    if (px[i] == lx) ext[0] = i;
    if (py[i] == ly) ext[1] = i;
    if (px[i] == ux) ext[2] = i;
    if (py[i] == uy) ext[3] = i;
  }
  for (int i = 0; i < 4; ++i) {
    for (int j = 0; j < 4; ++j) {
      if (i == j) continue;
      for (int v = 0; v < n; ++v) {
        p = max(p, get_p(ext[i], ext[j], v));
      }
    }
  }
  cout << p << ' ';
  for (int i = 3; i < n; ++i) cout << ap << ' ';
  cout << flush;
  return 0;
}
