#include <bits/stdc++.h>
using namespace std;
const int MAXN = 3e5 + 5;
const long long inf = 1e15 + 5;
struct point {
  long long x, y;
};
bool operator<(const point A, const point B) {
  if (A.x != B.x) return A.x < B.x;
  return A.y < B.y;
}
bool operator==(const point A, const point B) {
  if (A.x != B.x) return false;
  if (A.y != B.y) return false;
  return true;
}
long long calcDist(point A, point B) { return abs(A.x - B.x) + abs(A.y - B.y); }
int n;
point a[MAXN];
vector<point> v;
long long maxX, minX, maxY, minY;
long long answer1 = 0, answer2 = 0;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i].x >> a[i].y;
    if (i != 0) answer2 += calcDist(a[i - 1], a[i]);
  }
  answer2 += calcDist(a[0], a[n - 1]);
  maxX = a[0].x;
  minX = a[0].x;
  minY = a[0].y;
  maxY = a[0].y;
  for (int i = 1; i < n; i++) {
    maxX = max(maxX, a[i].x);
    maxY = max(maxY, a[i].y);
    minX = min(minX, a[i].x);
    minY = min(minY, a[i].y);
  }
  for (int i = 0; i < n; i++) {
    if (a[i].x == maxX) {
      v.push_back(a[i]);
    } else if (a[i].x == minX) {
      v.push_back(a[i]);
    } else if (a[i].y == maxY) {
      v.push_back(a[i]);
    } else if (a[i].y == minY) {
      v.push_back(a[i]);
    }
  }
  for (int i = 0; i < v.size(); i++) {
    for (int j = i + 1; j < v.size(); j++) {
      for (int k = 0; k < n; k++) {
        if (a[k] == v[i] || a[k] == v[j]) continue;
        answer1 = max(answer1, calcDist(v[i], v[j]) + calcDist(v[i], a[k]) +
                                   calcDist(v[j], a[k]));
      }
    }
  }
  cout << answer1;
  for (int i = 4; i <= n; i++) cout << " " << answer2;
  cout << '\n';
}
