#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10;
const int INF = 1e9;
long long x[N], y[N], k[7], p[N][4], dp[N][4];
int main() {
  ios_base::sync_with_stdio(0);
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> x[i] >> y[i];
  }
  long long minx = INF, maxx = -INF, miny = INF, maxy = -INF;
  for (int i = 1; i <= n; i++) {
    minx = min(minx, x[i]);
    maxx = max(maxx, x[i]);
    miny = min(miny, y[i]);
    maxy = max(maxy, y[i]);
  }
  long long ans = 0;
  for (int mask = 0; mask < (1 << 6); mask++) {
    k[1] = k[2] = k[3] = k[4] = k[5] = k[6] = 0;
    if (mask & (1 << 0)) {
      k[3]++;
      k[1]--;
    } else {
      k[3]--;
      k[1]++;
    }
    if (mask & (1 << 1)) {
      k[4]++;
      k[2]--;
    } else {
      k[4]--;
      k[2]++;
    }
    if (mask & (1 << 2)) {
      k[5]++;
      k[3]--;
    } else {
      k[5]--;
      k[3]++;
    }
    if (mask & (1 << 3)) {
      k[6]++;
      k[4]--;
    } else {
      k[6]--;
      k[4]++;
    }
    if (mask & (1 << 4)) {
      k[1]++;
      k[5]--;
    } else {
      k[1]--;
      k[5]++;
    }
    if (mask & (1 << 5)) {
      k[2]++;
      k[6]--;
    } else {
      k[2]--;
      k[6]++;
    }
    for (int i = 1; i <= n; i++) {
      p[i][1] = k[1] * x[i] + k[2] * y[i];
      p[i][2] = k[3] * x[i] + k[4] * y[i];
      p[i][3] = k[5] * x[i] + k[6] * y[i];
    }
    dp[0][1] = dp[0][2] = dp[0][3] = dp[1][2] = dp[1][3] = dp[2][3] = -INF;
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= min(i, 3); j++) {
        dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - 1] + p[i][j]);
      }
    }
    ans = max(ans, dp[n][3]);
  }
  cout << ans << " ";
  for (int i = 4; i <= n; i++) {
    cout << 2 * (maxx - minx + maxy - miny) << " ";
  }
  cout << "\n";
  return 0;
}
