#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T read(T& x) {
  x = 0;
  int f = 0;
  char ch = getchar();
  while (ch < '0' || ch > '9') f |= (ch == '-'), ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  return x = f ? -x : x;
}
const int N = 3e5 + 10;
const int INF = 2000000000;
int n, k, i, ans, minx, maxx, miny, maxy, x[N], y[N];
int main() {
  read(n);
  minx = miny = INF, maxx = maxy = -INF;
  for (i = 0; i < n; ++i) {
    read(x[i]), read(y[i]);
    minx = min(minx, x[i]);
    miny = min(miny, y[i]);
    maxx = max(maxx, x[i]);
    maxy = max(maxy, y[i]);
  }
  for (ans = -INF, i = 0; i < n; ++i) {
    ans = max(ans, 2 * (maxx - x[i]) + 2 * (maxy - y[i]));
    ans = max(ans, 2 * (maxx - x[i]) + 2 * (y[i] - miny));
    ans = max(ans, 2 * (x[i] - minx) + 2 * (maxy - y[i]));
    ans = max(ans, 2 * (x[i] - minx) + 2 * (y[i] - miny));
  }
  printf("%d%c", ans, n == 3 ? '\n' : ' ');
  for (i = 4; i <= n; ++i)
    printf("%d%c", 2 * (maxx - minx + maxy - miny), i == n ? '\n' : ' ');
  return 0;
}
