#include <bits/stdc++.h>
using namespace std;
const int MAXN = 3e5 + 5;
pair<int, int> arr[MAXN];
bool cmp(const pair<int, int>& a, const pair<int, int>& b) {
  if (a.second != b.second) {
    return a.second < b.second;
  }
  return a.first < b.first;
}
int main() {
  int n;
  scanf("%d", &n);
  int minx = 0x3f3f3f3f, miny = 0x3f3f3f3f, maxx = -0x3f3f3f3f,
      maxy = -0x3f3f3f3f;
  int xy[2][4] = {{-0x3f3f3f3f, -0x3f3f3f3f, -0x3f3f3f3f, -0x3f3f3f3f},
                  {0x3f3f3f3f, 0x3f3f3f3f, 0x3f3f3f3f, 0x3f3f3f3f}};
  int xy2[2][4][4];
  for (int i = 0; i < 4; i++) {
    for (int j = 0; j < 4; j++) {
      xy2[1][i][j] = 0x3f3f3f3f;
      xy2[0][i][j] = -0x3f3f3f3f;
    }
  }
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &arr[i].first, &arr[i].second);
    minx = min(minx, arr[i].first);
    maxx = max(maxx, arr[i].first);
    miny = min(miny, arr[i].second);
    maxy = max(maxy, arr[i].second);
    int x = arr[i].first, y = arr[i].second;
    xy[0][0] = max(xy[0][0], x + y);
    xy[0][1] = max(xy[0][1], x - y);
    xy[0][2] = max(xy[0][2], -x + y);
    xy[0][3] = max(xy[0][3], -x - y);
    xy[1][0] = min(xy[1][0], x + y);
    xy[1][1] = min(xy[1][1], x - y);
    xy[1][2] = min(xy[1][2], -x + y);
    xy[1][3] = min(xy[1][3], -x - y);
    for (int j = 0; j < 4; j++) {
      for (int k = 0; k < 4; k++) {
        int tmp = 0;
        if (j & 2) {
          tmp += x;
        } else {
          tmp -= x;
        }
        if (j & 1) {
          tmp += y;
        } else {
          tmp -= y;
        }
        if (k & 1) {
          tmp -= x;
        } else {
          tmp += x;
        }
        if (k & 2) {
          tmp -= y;
        } else {
          tmp += y;
        }
        xy2[0][j][k] = max(xy2[0][j][k], tmp);
        xy2[1][j][k] = min(xy2[1][j][k], tmp);
      }
    }
  }
  if (n == 3) {
    printf("%d\n", 2 * (maxx - minx + maxy - miny));
  } else {
    int ans = 0;
    for (int i = 0; i < 4; i++) {
      for (int j = 0; j < 2; j++) {
        ans = max(ans, 2 * xy[0][i] + xy2[0][i][j] + xy2[0][i][j ^ 3]);
      }
    }
    printf("%d ", ans);
    ans = maxx - minx + maxy - miny;
    for (int i = 4; i <= n; i++) {
      printf("%d ", ans * 2);
    }
    putchar('\n');
  }
  return 0;
}
