#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 100;
int p[N][2];
int main() {
  int n;
  cin >> n;
  cin >> p[0][0] >> p[0][1];
  int P = 0;
  int X, x, Y, y;
  X = x = p[0][0];
  Y = y = p[0][1];
  for (int i = 1; i < n; i++) {
    cin >> p[i][0] >> p[i][1];
    X = max(X, p[i][0]);
    x = min(x, p[i][0]);
    Y = max(Y, p[i][1]);
    y = min(y, p[i][1]);
    P += abs(p[i][0] - p[i - 1][0]) + abs(p[i][1] - p[i - 1][1]);
  }
  P += abs(p[0][0] - p[n - 1][0]) + abs(p[0][1] - p[n - 1][1]);
  int mx = 0;
  for (int i = 0; i < n; i++) {
    mx = max(mx, max(abs(X - p[i][0]), abs(x - p[i][0])) +
                     max(abs(Y - p[i][1]), abs(y - p[i][1])));
  }
  cout << 2 * mx << ' ';
  for (int i = 4; i <= n; i++) {
    cout << P << ' ';
  }
}
