#include <bits/stdc++.h>
using namespace std;
int n, x[300100], y[300100], ans = 0;
int p, q, f, g, x1, t;
vector<pair<int, int>> sx;
vector<pair<int, int>> sy;
int xmx = INT_MIN, xmn = INT_MAX;
int ymx = INT_MIN, ymn = INT_MAX;
bool cmp(pair<int, int> a, pair<int, int> b) {
  if (a.first + a.second < b.first + b.second) return true;
  return false;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> x[i] >> y[i];
    xmx = max(xmx, x[i]);
    xmn = min(xmn, x[i]);
    ymx = max(ymx, y[i]);
    ymn = min(ymn, y[i]);
  }
  for (int i = 0; i < n; i++) {
    ans = max(ans,
              2 * (max(xmx - x[i], x[i] - xmn) + max(ymx - y[i], y[i] - ymn)));
  }
  cout << ans << " ";
  ans = max(ans, 2 * (xmx - xmn + ymx - ymn));
  for (int i = 4; i <= n; i++) cout << ans << " ";
  return 0;
}
