#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("-O2")
template <typename tp>
void in(tp &dig) {
  char ch = getchar();
  dig = 0;
  long long flag = 0;
  while (!isdigit(ch)) {
    if (ch == '-') flag = 1;
    ch = getchar();
  }
  while (isdigit(ch)) dig = dig * 10 + ch - '0', ch = getchar();
  if (flag) dig = -dig;
}
template <typename T>
void chkmax(T &x, T y) {
  x = max(x, y);
}
template <typename T>
void chkmin(T &x, T y) {
  x = min(x, y);
}
const int LIM = 2e5 + 5, MOD = 1e9 + 7;
long long n, m, t;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  long long x[n], y[n];
  long long maxx, minx, maxy, miny;
  for (int i = 0; i < n; i++) {
    cin >> x[i] >> y[i];
    if (i == 0) {
      maxx = minx = x[0];
      miny = maxy = y[0];
    } else {
      maxx = max(maxx, x[i]);
      maxy = max(maxy, y[i]);
      miny = min(miny, y[i]);
      minx = min(minx, x[i]);
    }
  }
  if (n == 3) {
    cout << 2 * (maxy - miny) + 2 * (maxx - minx);
  } else {
    long long ans = 0, xi, yi;
    for (int i = 0; i < n; i++) {
      xi = max(maxx - x[i], x[i] - minx);
      yi = max(maxy - y[i], y[i] - miny);
      ans = max(ans, 2 * (xi + yi));
    }
    cout << ans << " ";
    for (int i = 4; i < n + 1; i++) {
      cout << 2 * (maxy - miny) + 2 * (maxx - minx) << " ";
    }
  }
  return 0;
}
