#include <bits/stdc++.h>
using namespace std;
long long get(vector<pair<int, int>> v) {
  long long ans = 0;
  for (int i = 0; i < v.size(); ++i) {
    ans += abs(v[i].first - v[(i + 1) % v.size()].first);
    ans += abs(v[i].second - v[(i + 1) % v.size()].second);
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  vector<pair<int, int>> a(n);
  pair<int, int> min_x = {1e9, -1}, max_x = {-1e9, -1}, min_y = {1e9, -1},
                 max_y = {-1e9, -1};
  for (int i = 0; i < n; ++i) {
    cin >> a[i].first >> a[i].second;
    min_x = min(min_x, make_pair(a[i].first, i));
    max_x = max(max_x, make_pair(a[i].first, i));
    min_y = min(min_y, make_pair(a[i].second, i));
    max_y = max(max_y, make_pair(a[i].second, i));
  }
  vector<int> ind = {min_x.second, max_x.second, min_y.second, max_y.second};
  sort(ind.begin(), ind.end());
  ind.erase(unique(ind.begin(), ind.end()), ind.end());
  long long a3 = 0, a4 = get(a);
  for (int i = 0; i < ind.size(); ++i)
    for (int j = i + 1; j < ind.size(); ++j) {
      vector<pair<int, int>> now = {a[ind[i]], a[ind[j]]};
      for (int k = 0; k < n; ++k)
        if (k != ind[i] && k != ind[j]) {
          now.push_back(a[k]);
          a3 = max(a3, get(now));
          now.pop_back();
        }
    }
  cout << a3 << ' ';
  for (int k = 4; k++ <= n; cout << a4 << ' ')
    ;
}
