#include <bits/stdc++.h>
using namespace std;
long long operator%(pair<long long, long long> a,
                    pair<long long, long long> b) {
  return a.first * b.second - a.second * b.first;
}
bool angle_cmp(pair<long long, long long> a, pair<long long, long long> b) {
  return a % b > 0;
}
pair<long long, long long> p[300000];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> p[i].first >> p[i].second;
  sort(p, p + n);
  pair<long long, long long> base = p[0];
  for (int i = 0; i < n; i++) {
    p[i].first -= base.first;
    p[i].second -= base.second;
  }
  sort(p + 1, p + n, angle_cmp);
  pair<long long, long long> mi(1e9, 1e9), ma(-1e9, -1e9);
  for (int i = 0; i < n; i++) {
    mi.first = min(mi.first, p[i].first);
    mi.second = min(mi.second, p[i].second);
    ma.first = max(ma.first, p[i].first);
    ma.second = max(ma.second, p[i].second);
  }
  long long ans = 0;
  for (int i = 0; i < n; i++) {
    ans = max(ans, p[i].first + p[i].second - mi.first - mi.second);
    ans = max(ans, p[i].first - p[i].second - mi.first + ma.second);
    ans = max(ans, -p[i].first + p[i].second + ma.first - mi.second);
    ans = max(ans, -p[i].first - p[i].second + ma.first + ma.second);
  }
  cout << ans * 2 << ' ';
  for (int i = 4; i <= n; i++)
    cout << (ma.first - mi.first + ma.second - mi.second) * 2 << ' ';
  cout << endl;
}
