#include <bits/stdc++.h>
using namespace std;
const int lim = 1e9;
int main() {
  int n;
  scanf("%d", &n);
  vector<int> x(n), y(n);
  int xmx = -lim, xmn = lim, ymx = -lim, ymn = lim;
  for (int i = 0; i < n; ++i) {
    scanf("%d%d", &x[i], &y[i]);
    xmx = max(xmx, x[i]);
    xmn = min(xmn, x[i]);
    ymx = max(ymx, y[i]);
    ymn = min(ymn, y[i]);
  }
  int ans = -1;
  for (int i = 0; i < n; ++i) {
    ans = max(ans,
              2 * (max(x[i] - xmn, xmx - x[i]) + max(y[i] - ymn, ymx - y[i])));
  }
  printf("%d ", ans);
  int same = 2 * (xmx + ymx - xmn - ymn);
  for (int i = 4; i <= n; ++i) {
    printf("%d ", same);
  }
  return 0;
}
