#include <bits/stdc++.h>
using namespace std;
long long per(vector<pair<long long, long long> >& v) {
  long long lx = v[0].first;
  long long hx = v[0].first;
  long long ly = v[0].second;
  long long hy = v[0].second;
  for (long long(i) = 0; (i) < (v.size()); ++(i)) {
    lx = min(lx, v[i].first);
    hx = max(hx, v[i].first);
    ly = min(ly, v[i].second);
    hy = max(hy, v[i].second);
  }
  return 2 * (hx - lx + hy - ly);
}
void solve() {
  long long n;
  cin >> n;
  vector<pair<long long, long long> > v(n);
  for (long long(i) = 0; (i) < (n); ++(i)) {
    cin >> v[i].first >> v[i].second;
  }
  if (n == 3) {
    cout << per(v) << endl;
    return;
  }
  long long lx = v[0].first;
  long long hx = v[0].first;
  long long ly = v[0].second;
  long long hy = v[0].second;
  for (long long(i) = 0; (i) < (v.size()); ++(i)) {
    lx = min(lx, v[i].first);
    hx = max(hx, v[i].first);
    ly = min(ly, v[i].second);
    hy = max(hy, v[i].second);
  }
  long long m3 = 0;
  for (long long(i) = 0; (i) < (n); ++(i)) {
    vector<pair<long long, long long> > tv(2);
    tv[0] = v[i];
    tv[1] = make_pair(lx, ly);
    m3 = max(m3, per(tv));
    tv[1] = make_pair(lx, hy);
    m3 = max(m3, per(tv));
    tv[1] = make_pair(hx, ly);
    m3 = max(m3, per(tv));
    tv[1] = make_pair(hx, hy);
    m3 = max(m3, per(tv));
  }
  cout << m3 << " ";
  long long m4 = per(v);
  for (long long(i) = 0; (i) < (n - 3); ++(i)) {
    cout << m4 << " ";
  }
}
int main() {
  ios::sync_with_stdio(false);
  solve();
  return 0;
}
