#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 300000;
const int INF = 1 << 30;
int xs[MAX_N], ys[MAX_N], vs[8];
int main() {
  int n;
  scanf("%d", &n);
  int minxi0 = -1, maxxi0 = -1;
  int minyi0 = -1, maxyi0 = -1;
  for (int i = 0; i < n; i++) {
    scanf("%d%d", xs + i, ys + i);
    if (minxi0 < 0 || xs[minxi0] > xs[i]) minxi0 = i;
    if (maxxi0 < 0 || xs[maxxi0] < xs[i]) maxxi0 = i;
    if (minyi0 < 0 || ys[minyi0] > ys[i]) minyi0 = i;
    if (maxyi0 < 0 || ys[maxyi0] < ys[i]) maxyi0 = i;
  }
  int f3 = 0;
  for (int i = 0; i < n; i++) {
    f3 = max(f3, ((xs[i] - xs[minxi0]) + (ys[i] - ys[minyi0])) * 2);
    f3 = max(f3, ((xs[maxxi0] - xs[i]) + (ys[i] - ys[minyi0])) * 2);
    f3 = max(f3, ((xs[i] - xs[minxi0]) + (ys[maxyi0] - ys[i])) * 2);
    f3 = max(f3, ((xs[maxxi0] - xs[i]) + (ys[maxyi0] - ys[i])) * 2);
  }
  int fn = ((xs[maxxi0] - xs[minxi0]) + (ys[maxyi0] - ys[minyi0])) * 2;
  printf("%d", f3);
  for (int i = 4; i <= n; i++) printf(" %d", fn);
  putchar('\n');
  return 0;
}
