#include <bits/stdc++.h>
using namespace std;
long long x[300010], y[300010];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, minx = 1e18, miny = 1e18, maxx = -1e18, maxy = -1e18, pmnx = -1,
               pmxx = -1, pmny = -1, pmxy = -1;
  cin >> n;
  for (int i = 0, ThxDem = n; i < ThxDem; ++i) {
    cin >> x[i] >> y[i];
    if (x[i] < minx) minx = x[i], pmnx = i;
    if (x[i] > maxx) maxx = x[i], pmxx = i;
    if (y[i] < miny) miny = y[i], pmny = i;
    if (y[i] > maxy) maxy = y[i], pmxy = i;
  }
  vector<long long> pos = {pmnx, pmxx, pmny, pmxy};
  sort(pos.begin(), pos.end());
  long long ans3 = 0;
  do {
    long long one = pos[0], two = pos[1];
    for (int i = 0, ThxDem = n; i < ThxDem; ++i) {
      if (i != one && i != two) {
        long long i1 = abs(x[one] - x[i]) + abs(y[one] - y[i]);
        long long i2 = abs(x[two] - x[i]) + abs(y[two] - y[i]);
        long long x12 = abs(x[one] - x[two]) + abs(y[one] - y[two]);
        ans3 = max(ans3, i1 + i2 + x12);
      }
    }
  } while (next_permutation(pos.begin(), pos.end()));
  cout << ans3 << " ";
  for (int i = 4, ThxDem = n + 1; i < ThxDem; ++i)
    cout << 2 * (maxx - minx) + 2 * (maxy - miny) << " ";
  cout << endl;
}
