#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5 + 100;
const long long mod = 1e9 + 7;
using namespace std;
int main() {
  int xx = 100000009, dx = -100000009, xy = 100000009, dy = -100000009;
  int n;
  scanf("%d", &(n));
  int pointx[maxn], pointy[maxn];
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &(pointx[i]), &(pointy[i]));
    xx = min(xx, pointx[i]);
    dx = max(dx, pointx[i]);
    xy = min(xy, pointy[i]);
    dy = max(dy, pointy[i]);
  }
  int ans = 0;
  for (int i = 0; i < n; i++) {
    ans = max(ans, dx - pointx[i] + dy - pointy[i]);
    ans = max(ans, dx - pointx[i] + pointy[i] - xy);
    ans = max(ans, pointx[i] - xx + dy - pointy[i]);
    ans = max(ans, pointx[i] - xx + pointy[i] - xy);
  }
  printf("%d ", ans << 1);
  for (int i = 4; i <= n; i++) {
    printf("%d ", 2 * ((dx - xx) + (dy - xy)));
  }
  printf("\n");
  return 0;
}
