#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
  if (a < b) swap(a, b);
  if (b == 0) return a;
  while ((a = a % b) != 0) {
    swap(a, b);
  }
  return b;
}
long long mpow(long long x, long long y, long long m) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = res * x % m;
    y = y >> 1;
    x = x * x % m;
  }
  return res;
}
long long ncr(long long n, long long r) {
  if (r > n) return 0;
  long long res = 1;
  for (long long i = (1); i < (r + 1); i++) res = res * (n - r + i) / i;
  return res;
}
long long *sieve(long long n) {
  long long *lpf = new long long[n + 1];
  for (long long i = 1; i <= n; i++) lpf[i] = i;
  long long rt = (long long)floor(sqrt(n)) + 1;
  for (long long i = (2); i < (rt); i++) {
    if (lpf[i] != i) continue;
    for (long long j = i * i; j <= n; j += i) {
      if (lpf[j] == j) lpf[j] = i;
    }
  }
  return lpf;
}
void solve() {
  long long n;
  cin >> n;
  long long x[n], y[n];
  for (long long i = (0); i < (n); i++) cin >> x[i] >> y[i];
  long long xmn = *min_element(x, x + n), xmx = *max_element(x, x + n);
  long long ymn = *min_element(y, y + n), ymx = *max_element(y, y + n);
  long long ans1 = 0, ans2 = 2 * (xmx - xmn + ymx - ymn);
  for (long long i = (0); i < (n); i++) {
    ans1 = max(ans1,
               2 * (max(xmx - x[i], x[i] - xmn) + max(ymx - y[i], y[i] - ymn)));
  }
  cout << ans1 << " ";
  for (long long i = (4); i < (n + 1); i++) cout << ans2 << " ";
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t = 1;
  for (long long i = (1); i < (t + 1); i++) {
    solve();
    cout << "\n";
  }
}
