#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  int n;
  cin >> n;
  int x[330000], y[330000];
  int maxx, minx, maxy, miny;
  for (int i = 0; i < n; i++) {
    cin >> x[i] >> y[i];
    if (i == 0) {
      maxx = x[i];
      minx = x[i];
      maxy = y[i];
      miny = y[i];
    } else {
      maxx = max(x[i], maxx);
      minx = min(x[i], minx);
      maxy = max(y[i], maxy);
      miny = min(y[i], miny);
    }
  }
  vector<int> kr;
  for (int i = 0; i < n; i++) {
    if (x[i] == maxx) {
      kr.push_back(i);
      break;
    }
  }
  for (int i = 0; i < n; i++) {
    if (x[i] == minx) {
      kr.push_back(i);
      break;
    }
  }
  for (int i = 0; i < n; i++) {
    if (y[i] == maxy) {
      kr.push_back(i);
      break;
    }
  }
  for (int i = 0; i < n; i++) {
    if (y[i] == miny) {
      kr.push_back(i);
      break;
    }
  }
  int f3 = 0;
  for (int i = 0; i < 2; i++) {
    for (int j = 2; j < 4; j++) {
      int p1 = kr[i], p2 = kr[j];
      for (int p3 = 0; p3 < n; p3++) {
        if (p3 != p1 && p3 != p2) {
          f3 = max(f3, abs(x[p1] - x[p2]) + abs(x[p2] - x[p3]) +
                           abs(x[p3] - x[p1]) + abs(y[p1] - y[p2]) +
                           abs(y[p2] - y[p3]) + abs(y[p3] - y[p1]));
        }
      }
    }
  }
  cout << f3 << " ";
  for (int i = 0; i < n - 3; i++) {
    cout << 2 * (maxx - minx + maxy - miny) << " ";
  }
  cout << endl;
}
