#include <bits/stdc++.h>
using namespace std;
long long i, n, x, y, maX, miX, maY, miY;
const long long oo = round(1e9) + 1;
struct pt {
  long long x, y;
};
pt a[300001];
bool cmp(pt a, pt b) { return a.x < b.x; }
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  maX = maY = -oo;
  miX = miY = oo;
  for (i = 1; i <= n; i++) {
    cin >> x >> y;
    maX = max(maX, x);
    maY = max(maY, y);
    miX = min(miX, x);
    miY = min(miY, y);
    a[i] = {x, y};
  }
  for (i = 3; i <= n; i++)
    if (i == 3) {
      long long kq = 0, ma = -oo, mi = oo;
      sort(a + 1, a + n + 1, cmp);
      for (int i = 1; i <= n; i++) {
        ma = max(ma, a[i].y);
        mi = min(mi, a[i].y);
        kq = max(kq, a[i].x - a[1].x + a[i].y - mi);
        kq = max(kq, a[i].x - a[1].x + ma - a[i].y);
      }
      ma = -oo;
      mi = oo;
      for (int i = n; i >= 1; i--) {
        ma = max(ma, a[i].y);
        mi = min(mi, a[i].y);
        kq = max(kq, a[n].x - a[i].x + a[i].y - mi);
        kq = max(kq, a[n].x - a[i].x + ma - a[i].y);
      }
      cout << 2 * kq << " ";
    } else
      cout << (maX - miX + maY - miY) * 2 << ' ';
}
