#include <bits/stdc++.h>
using namespace std;
const long long N = (5e5) + 322;
const long long INF = (long long)(1e12);
const long long mod = 998244353;
const double eps = 1e-9;
long long n, mxx = -INF, mxy = -INF, mnx = INF, mny = INF, x[N], y[N], ans,
             mx = -INF, mn = INF;
vector<pair<long long, long long> > v;
long long calc(long long x, long long y) { return (x + y) * 2; }
void solve() {
  long long cnt = 0;
  mx = -INF;
  mn = INF;
  for (auto it : v) {
    cnt++;
    if (cnt >= 3) {
      ans = max(calc(abs(it.first - mnx), abs(it.second - mx)), ans);
      ans = max(calc(abs(it.first - mnx), abs(it.second - mn)), ans);
    }
    mx = max(mx, it.second);
    mn = min(mn, it.second);
  }
  mx = -INF;
  mn = INF;
  cnt = 0;
  reverse(v.begin(), v.end());
  for (auto it : v) {
    cnt++;
    if (cnt >= 3) {
      ans = max(calc(abs(it.first - mxx), abs(it.second - mx)), ans);
      ans = max(calc(abs(it.first - mxx), abs(it.second - mn)), ans);
    }
    mx = max(mx, it.second);
    mn = min(mn, it.second);
  }
  v.clear();
  for (long long i = 1; i <= n; ++i) {
    v.push_back(make_pair(y[i], x[i]));
  }
  sort(v.begin(), v.end());
  cnt = 0;
  mx = -INF;
  mn = INF;
  for (auto it : v) {
    cnt++;
    if (cnt >= 3) {
      ans = max(calc(abs(it.first - mny), abs(it.second - mx)), ans);
      ans = max(calc(abs(it.first - mny), abs(it.second - mn)), ans);
    }
    mx = max(mx, it.second);
    mn = min(mn, it.second);
  }
  mx = -INF;
  mn = INF;
  cnt = 0;
  reverse(v.begin(), v.end());
  for (auto it : v) {
    cnt++;
    if (cnt >= 3) {
      ans = max(calc(abs(it.first - mxy), abs(it.second - mx)), ans);
      ans = max(calc(abs(it.first - mxy), abs(it.second - mn)), ans);
    }
    mx = max(mx, it.second);
    mn = min(mn, it.second);
  }
}
signed main() {
  ios_base ::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (long long i = 1; i <= n; ++i) {
    cin >> x[i] >> y[i];
    mxx = max(mxx, x[i]);
    mnx = min(mnx, x[i]);
    mxy = max(mxy, y[i]);
    mny = min(mny, y[i]);
    v.push_back(make_pair(x[i], y[i]));
  }
  sort(v.begin(), v.end());
  solve();
  cout << ans << ' ';
  for (long long i = 4; i <= n; ++i) {
    cout << (abs(mxx - mnx) + abs(mxy - mny)) * 2 << ' ';
  }
  return 0;
}
