#include <bits/stdc++.h>
using namespace std;
long long n;
vector<pair<long long, long long>> pts;
long long per(pair<long long, long long> x1, pair<long long, long long> x2,
              pair<long long, long long> x3) {
  return abs(x1.first - x2.first) + abs(x1.first - x3.first) +
         abs(x2.first - x3.first) + abs(x1.second - x2.second) +
         abs(x1.second - x3.second) + abs(x2.second - x3.second);
}
long long max_per(vector<long long> v1, vector<long long> v2,
                  vector<pair<long long, long long>> pts1) {
  long long ans = 0;
  for (long long i = 0; i < v1.size(); i++) {
    for (long long j = 0; j < v2.size(); j++) {
      long long p1 = v1[i];
      long long p2 = v2[j];
      for (int k = 0; k < n; k++) {
        if (k != p1 && k != p2 && p1 != p2) {
          if (ans < per(pts1[k], pts1[p1], pts1[p2]))
            ans = per(pts1[k], pts1[p1], pts1[p2]);
        }
      }
    }
  }
  return ans;
}
int main() {
  cin >> n;
  vector<long long> perimeters(n + 1, 0);
  long long left = 1e10;
  long long right = 0 - 1e10;
  long long up = 0 - 1e10;
  long long down = 1e10;
  vector<long long> up_ind, down_ind, left_ind, right_ind;
  for (int i = 0; i < n; i++) {
    long long x, y;
    cin >> x >> y;
    pts.push_back(make_pair(x, y));
    if (x <= left) {
      left = x;
    }
    if (x >= right) {
      right = x;
    }
    if (y >= up) {
      up = y;
    }
    if (y <= down) {
      down = y;
    }
  }
  for (int i = 0; i < n; i++) {
    long long x, y;
    x = pts[i].first;
    y = pts[i].second;
    if (x == left) {
      left_ind.push_back(i);
    }
    if (x == right) {
      right_ind.push_back(i);
    }
    if (y == up) {
      up_ind.push_back(i);
    }
    if (y == down) {
      down_ind.push_back(i);
    }
  }
  long long p2 = 2;
  long long ans = p2 * (right - left) + p2 * (up - down);
  long long ans_3 = 0;
  ans_3 = max(ans_3, max_per(up_ind, down_ind, pts));
  ans_3 = max(ans_3, max_per(up_ind, right_ind, pts));
  ans_3 = max(ans_3, max_per(up_ind, left_ind, pts));
  ans_3 = max(ans_3, max_per(left_ind, down_ind, pts));
  ans_3 = max(ans_3, max_per(right_ind, down_ind, pts));
  ans_3 = max(ans_3, max_per(left_ind, right_ind, pts));
  cout << ans_3 << " ";
  for (long long i = 4; i <= n; i++) cout << ans << " ";
}
