#include <bits/stdc++.h>
using namespace std;
int a[310000][2];
int main() {
  int i, j, n, ma, mi, ans, ans1;
  vector<pair<int, int> > q;
  vector<int> p;
  int minx, maxx, miny, maxy;
  scanf("%d", &n);
  minx = 2000000000;
  maxx = -2000000000;
  miny = 2000000000;
  maxy = -2000000000;
  for (i = 0; i < n; i++) {
    scanf("%d%d", &a[i][0], &a[i][1]);
    if (a[i][0] > maxx) maxx = a[i][0];
    if (a[i][0] < minx) minx = a[i][0];
    if (a[i][1] > maxy) maxy = a[i][1];
    if (a[i][1] < miny) miny = a[i][1];
  }
  ans = (maxx - minx + maxy - miny) * 2;
  q.clear();
  mi = 2000000000;
  ma = -2000000000;
  for (i = 0; i < n; i++)
    if (a[i][0] == minx) {
      if (a[i][1] < mi) mi = a[i][1];
      if (a[i][1] > ma) ma = a[i][1];
    }
  q.push_back(make_pair(minx, mi));
  if (ma != mi) q.push_back(make_pair(minx, ma));
  mi = 2000000000;
  ma = -2000000000;
  for (i = 0; i < n; i++)
    if (a[i][0] == maxx) {
      if (a[i][1] < mi) mi = a[i][1];
      if (a[i][1] > ma) ma = a[i][1];
    }
  q.push_back(make_pair(maxx, mi));
  if (ma != mi) q.push_back(make_pair(maxx, ma));
  mi = 2000000000;
  ma = -2000000000;
  for (i = 0; i < n; i++)
    if (a[i][1] == miny) {
      if (a[i][0] < mi) mi = a[i][0];
      if (a[i][0] > ma) ma = a[i][0];
    }
  q.push_back(make_pair(mi, miny));
  if (ma != mi) q.push_back(make_pair(ma, miny));
  mi = 2000000000;
  ma = -2000000000;
  for (i = 0; i < n; i++)
    if (a[i][1] == maxy) {
      if (a[i][0] < mi) mi = a[i][0];
      if (a[i][0] > ma) ma = a[i][0];
    }
  q.push_back(make_pair(mi, maxy));
  if (ma != mi) q.push_back(make_pair(ma, maxy));
  p.clear();
  for (i = 0; i < 2; i++) p.push_back(1);
  for (i = 2; i < q.size(); i++) p.push_back(0);
  ans1 = 0;
  for (j = 0; j < n; j++) {
    sort(p.begin(), p.end());
    do {
      minx = a[j][0];
      maxx = a[j][0];
      miny = a[j][1];
      maxy = a[j][1];
      for (i = 0; i < q.size(); i++)
        if (p[i] == 1) {
          if (q[i].first > maxx) maxx = q[i].first;
          if (q[i].first < minx) minx = q[i].first;
          if (q[i].second > maxy) maxy = q[i].second;
          if (q[i].second < miny) miny = q[i].second;
        }
      if ((maxx - minx + maxy - miny) * 2 > ans1)
        ans1 = (maxx - minx + maxy - miny) * 2;
    } while (next_permutation(p.begin(), p.end()));
  }
  printf("%d", ans1);
  for (i = 4; i <= n; i++) printf(" %d", ans);
  printf("\n");
  return 0;
}
