#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
struct point {
  int x, y;
  bool operator!=(const point &r) const { return x != r.x || y != r.y; }
};
int dis(point a, point b) { return abs(a.x - b.x) + abs(a.y - b.y); }
point p[300005];
int n;
point a[5] = {{}, {INF, INF}, {-INF, -INF}, {INF, INF}, {-INF, -INF}};
int main() {
  ios::sync_with_stdio(false);
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d%d", &p[i].x, &p[i].y);
    if (p[i].x < a[1].x) a[1] = p[i];
    if (p[i].x > a[2].x) a[2] = p[i];
    if (p[i].y < a[3].y) a[3] = p[i];
    if (p[i].y > a[4].y) a[4] = p[i];
  }
  int qwq = a[4].y - a[3].y + a[2].x - a[1].x;
  qwq <<= 1;
  int mx = 0;
  for (int i = 1; i < 4; i++)
    for (int j = i + 1; j <= 4; j++)
      for (int k = 1; k <= n; k++)
        if (p[k] != a[i] && p[k] != a[j])
          mx = max(mx, dis(a[i], a[j]) + dis(a[j], p[k]) + dis(a[i], p[k]));
  cout << mx;
  for (int i = 4; i <= n; i++) cout << " " << qwq;
}
