#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const int N = 3e5 + 5;
int n;
long long x[N], y[N], xmax, ymax, xmin, ymin;
vector<int> p;
long long solve(int i, int j, int k) {
  long long d1 = abs(x[j] - x[i]) + abs(y[j] - y[i]);
  long long d2 = abs(x[k] - x[j]) + abs(y[k] - y[j]);
  long long d3 = abs(x[k] - x[i]) + abs(y[k] - y[i]);
  return d1 + d2 + d3;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  xmax = ymax = -INF;
  xmin = ymin = INF;
  for (int i = 1; i <= n; i++) {
    cin >> x[i] >> y[i];
    xmax = max(xmax, x[i]);
    ymax = max(ymax, y[i]);
    xmin = min(xmin, x[i]);
    ymin = min(ymin, y[i]);
  }
  for (int i = 1; i <= n; i++) {
    if (x[i] == xmax)
      p.push_back(i);
    else if (x[i] == xmin)
      p.push_back(i);
    else if (y[i] == ymax)
      p.push_back(i);
    else if (y[i] == ymin)
      p.push_back(i);
  }
  long long sol = -10LL * INF;
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < p.size(); j++) {
      for (int k = j + 1; k < p.size(); k++) {
        sol = max(sol, solve(i, p[j], p[k]));
      }
    }
  }
  cout << sol << " ";
  for (int i = 4; i <= n; i++) cout << 2LL * (xmax - xmin + ymax - ymin) << " ";
  return 0;
}
