#include <bits/stdc++.h>
using namespace std;
int get(pair<int, int> a, pair<int, int> b, pair<int, int> c) {
  int x2 = max({a.first, b.first, c.first});
  int x1 = min({a.first, b.first, c.first});
  int y2 = max({a.second, b.second, c.second});
  int y1 = min({a.second, b.second, c.second});
  return x2 - x1 + y2 - y1;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  vector<pair<int, int>> p(n);
  for (int i = 0; i < n; ++i) cin >> p[i].first >> p[i].second;
  pair<int, int> x1, x2, y1, y2;
  x1.first = 1e9, x2.first = -1e9;
  y1.second = 1e9, y2.second = -1e9;
  for (int i = 0; i < n; ++i) {
    if (p[i].first > x2.first) {
      x2 = p[i];
    }
    if (p[i].first < x1.first) {
      x1 = p[i];
    }
    if (p[i].second > y2.second) {
      y2 = p[i];
    }
    if (p[i].second < y1.second) {
      y1 = p[i];
    }
  }
  int d = -1;
  for (int i = 0; i < n; ++i) {
    d = max(d, get(p[i], x1, y1));
    d = max(d, get(p[i], x1, y2));
    d = max(d, get(p[i], x2, y1));
    d = max(d, get(p[i], x2, y2));
  }
  cout << 2 * d << ' ';
  for (int i = 3; i < n; ++i)
    cout << 2 * (x2.first - x1.first + y2.second - y1.second) << ' ';
  cout << endl;
}
