#include <bits/stdc++.h>
using namespace std;
int n, res, X[300000], Y[300000];
int main() {
  cin >> n;
  for (int i = 0; i < n; ++i) cin >> X[i] >> Y[i];
  int x1 = X[0], y1 = Y[0], x2 = X[0], y2 = Y[0];
  for (int i = 1; i < n; ++i)
    x1 = min(x1, X[i]), y1 = min(y1, Y[i]), x2 = max(x2, X[i]),
    y2 = max(y2, Y[i]);
  for (int i = 0; i < n; ++i)
    res = max(res, X[i] - x1 + Y[i] - y1),
    res = max(res, X[i] - x1 + y2 - Y[i]),
    res = max(res, x2 - X[i] + Y[i] - y1),
    res = max(res, x2 - X[i] + y2 - Y[i]);
  cout << res * 2 << ' ';
  for (int i = 4; i <= n; ++i) cout << 2 * (x2 - x1 + y2 - y1) << ' ';
  return 0;
}
