#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, i, j, k, l;
  cin >> n;
  vector<pair<long long int, long long int> > v;
  long long int x1, x2, y1, y2;
  x1 = 1000000000000000000;
  x2 = -x1;
  y1 = 1000000000000000000;
  y2 = -y1;
  for (i = 0; i < n; i++) {
    long long int x, y;
    cin >> x >> y;
    v.push_back(make_pair(x, y));
    x1 = min(x1, x);
    x2 = max(x2, x);
    y1 = min(y1, y);
    y2 = max(y2, y);
  }
  long long int an = 2 * ((x2 - x1) + (y2 - y1));
  map<pair<long long int, long long int>, int> ma;
  int ch1 = 0;
  int ch2 = 0;
  int ch3 = 0;
  int ch4 = 0;
  for (i = 0; i < n; i++) {
    if (v[i].first == x1 && ch1 == 0) {
      ch1 = 1;
      ma[make_pair(v[i].first, v[i].second)] = i;
    }
    if (v[i].first == x2 && ch2 == 0) {
      ch2 = 1;
      ma[make_pair(v[i].first, v[i].second)] = i;
    }
    if (v[i].second == y1 && ch3 == 0) {
      ch3 = 1;
      ma[make_pair(v[i].first, v[i].second)] = i;
    }
    if (v[i].second == y2 && ch4 == 0) {
      ch4 = 1;
      ma[make_pair(v[i].first, v[i].second)] = i;
    }
  }
  long long int bn = -1;
  for (auto it = ma.begin(); it != ma.end(); it++) {
    auto lt = it;
    lt++;
    for (; lt != ma.end(); lt++) {
      int ind1 = (it->second);
      int ind2 = (lt->second);
      for (i = 0; i < n; i++) {
        if (i == ind1 || i == ind2) continue;
        long long int temp = abs(v[ind1].first - v[ind2].first) +
                             abs(v[ind1].second - v[ind2].second);
        temp +=
            abs(v[ind1].first - v[i].first) + abs(v[ind1].second - v[i].second);
        temp +=
            abs(v[ind2].first - v[i].first) + abs(v[ind2].second - v[i].second);
        bn = max(bn, temp);
      }
    }
  }
  cout << bn << " ";
  for (i = 4; i <= n; i++) cout << an << " ";
  return 0;
}
