#include <bits/stdc++.h>
using namespace std;
int ans = 0;
vector<pair<int, int> > vec, cur, sab;
void chk() {
  int mnx = min(cur[0].first, cur[1].first),
      mxx = max(cur[0].first, cur[1].first),
      mny = min(cur[0].second, cur[1].second),
      mxy = max(cur[0].second, cur[1].second);
  int tmnx, tmxx, tmny, tmxy;
  for (auto i : sab) {
    tmnx = min(mnx, i.first);
    tmxx = max(mxx, i.first);
    tmny = min(mny, i.second);
    tmxy = max(mxy, i.second);
    ans = max(ans, 2 * (tmxx - tmnx + tmxy - tmny));
  }
}
void cal(int idx) {
  if (cur.size() == 2) {
    chk();
    return;
  }
  if (idx == 4) return;
  cur.push_back(vec[idx]);
  cal(idx + 1);
  cur.pop_back();
  cal(idx + 1);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  cin >> n;
  sab.resize(n);
  pair<int, int> x;
  cin >> x.first >> x.second;
  sab[0] = x;
  pair<int, int> lowest = x, highest = x, leftmost = x, rightmost = x;
  for (int i = 1; i <= n - 1; ++i) {
    cin >> x.first >> x.second;
    sab[i] = x;
    if (x.first < leftmost.first) leftmost = x;
    if (x.first > rightmost.first) rightmost = x;
    if (x.second < lowest.second) lowest = x;
    if (x.second > highest.second) highest = x;
  }
  vec = {lowest, highest, leftmost, rightmost};
  cal(0);
  cout << ans << " ";
  ans = 2 * (rightmost.first - leftmost.first + highest.second - lowest.second);
  for (int i = 4; i <= n; ++i) {
    cout << ans << " ";
  }
  return 0;
}
