#include <bits/stdc++.h>
using namespace std;
const int maxn = 300010;
int x[maxn], y[maxn];
int n;
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d%d", &x[i], &y[i]);
  int minx = *min_element(x, x + n);
  int miny = *min_element(y, y + n);
  int maxx = *max_element(x, x + n);
  int maxy = *max_element(y, y + n);
  int s4 = (maxx - minx) + (maxy - miny);
  int s3 = 0;
  for (int i = 0; i < n; i++)
    s3 = max(s3, max(maxx - x[i], x[i] - minx) + max(maxy - y[i], y[i] - miny));
  printf("%d", s3 * 2);
  for (int i = 4; i <= n; i++) printf(" %d", s4 * 2);
  puts("");
  return 0;
}
