#include <bits/stdc++.h>
using namespace std;
const int inf = 1 << 30;
const int N = 3e5 + 1;
int n, l, r, t, b;
int ans;
pair<int, int> p[N];
void input() {
  cin >> n;
  l = inf, r = -inf;
  b = inf, t = -inf;
  for (int i = 1; i <= n; ++i) {
    cin >> p[i].first;
    cin >> p[i].second;
  }
  for (int i = 1; i <= n; ++i) {
    l = min(l, p[i].first);
    r = max(r, p[i].first);
    t = max(t, p[i].second);
    b = min(b, p[i].second);
  }
}
void solve() {
  for (int i = 1; i <= n; ++i) {
    for (int j = 0; j < 4; ++j) {
      for (int k = 0; k < j; ++k) {
        int L = l;
        int R = r;
        int B = b;
        int T = t;
        if (j == 0 || k == 0) {
          L = p[i].first;
        }
        if (j == 1 || k == 1) {
          R = p[i].first;
        }
        if (j == 2 || k == 2) {
          B = p[i].second;
        }
        if (j == 3 || k == 3) {
          T = p[i].second;
        }
        ans = max(ans, 2 * (R - L + T - B));
      }
    }
  }
  cout << ans << " ";
  for (int i = 4; i <= n; ++i) {
    cout << 2 * (r - l + t - b) << " ";
  }
  cout << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  input();
  solve();
}
