#include <bits/stdc++.h>
using namespace std;
const int MAXN = 3e5 + 50;
long long x[MAXN], y[MAXN];
long long labs(long long x) { return (x > 0) ? x : -x; }
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%lld%lld", &x[i], &y[i]);
  long long minX = *min_element(x + 1, x + n + 1),
            maxX = *max_element(x + 1, x + n + 1);
  long long minY = *min_element(y + 1, y + n + 1),
            maxY = *max_element(y + 1, y + n + 1);
  long long mx = 0;
  for (int i = 1; i <= n; i++) {
    for (long long a : {minX, maxX})
      for (long long b : {minY, maxY})
        mx = max(mx, labs(x[i] - a) + labs(y[i] - b));
  }
  printf("%lld ", 2 * mx);
  for (int i = 4; i <= n; i++)
    printf("%lld ", 2 * (maxX - minX) + 2 * (maxY - minY));
}
