#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 10;
pair<int, int> A[N];
int main() {
  int n;
  scanf("%d", &n);
  int minx, miny, maxx, maxy;
  minx = miny = 0x3f3f3f3f;
  maxx = maxy = -0x3f3f3f3f;
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &A[i].first, &A[i].second);
    minx = min(minx, A[i].first);
    maxx = max(maxx, A[i].first);
    miny = min(miny, A[i].second);
    maxy = max(maxy, A[i].second);
  }
  int ans = 0;
  for (int i = 0; i < n; i++) {
    ans = max(ans, max(abs(A[i].first - minx), abs(A[i].first - maxx)) +
                       max(abs(A[i].second - miny), abs(A[i].second - maxy)));
  }
  printf("%d", ans * 2);
  for (int i = 4; i < n + 1; i++) {
    printf(" %d", 2 * (maxy - miny + maxx - minx));
  }
  printf("\n");
  return 0;
}
