#include <bits/stdc++.h>
using namespace std;
constexpr int N = 300005;
int xs[N], ys[N], by_x[2], by_y[2];
int main() {
  int n;
  scanf("%d", &n);
  for (auto i = (0); i < (n); i++) {
    scanf("%d%d", xs + i, ys + i);
    if (xs[i] < xs[by_x[0]]) by_x[0] = i;
    if (xs[i] > xs[by_x[1]]) by_x[1] = i;
    if (ys[i] < ys[by_y[0]]) by_y[0] = i;
    if (ys[i] > ys[by_y[1]]) by_y[1] = i;
  }
  int ans = 0;
  for (auto i = (0); i < (2); i++) {
    int x0 = xs[by_x[i]], y0 = ys[by_x[i]];
    for (auto j = (0); j < (2); j++) {
      int x1 = xs[by_y[j]], y1 = ys[by_y[j]];
      for (auto k = (0); k < (n); k++)
        ans = max(ans, max(xs[k], max(x0, x1)) - min(xs[k], min(x0, x1)) +
                           max(ys[k], max(y0, y1)) - min(ys[k], min(y0, y1)));
    }
  }
  printf("%d", 2 * ans);
  ans = 2 * (ys[by_y[1]] - ys[by_y[0]] + xs[by_x[1]] - xs[by_x[0]]);
  for (auto j = (4); j < (n + 1); j++) printf(" %d", ans);
  printf("\n");
  return 0;
}
