#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cout << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cout.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
const int N = 1e5 + 5;
const int MAX = 2e6 + 5;
const int MOD = 1000000007;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  vector<int> x(n + 1), y(n + 1);
  for (long long i = (1); i <= (n); ++i) cin >> x[i] >> y[i];
  pair<pair<int, int>, int> p[5];
  int minx = MOD, miny = MOD, maxx = -MOD, maxy = -MOD, ans = -MOD;
  for (long long i = (1); i <= (n); ++i) {
    if (minx > x[i]) {
      minx = x[i];
      p[1].first.first = x[i];
      p[1].first.second = y[i];
      p[1].second = i;
    }
    if (maxy < y[i]) {
      maxy = y[i];
      p[2].first.first = x[i];
      p[2].first.second = y[i];
      p[2].second = i;
    }
    if (maxx < x[i]) {
      maxx = x[i];
      p[3].first.first = x[i];
      p[3].first.second = y[i];
      p[3].second = i;
    }
    if (miny > y[i]) {
      miny = y[i];
      p[4].first.first = x[i];
      p[4].first.second = y[i];
      p[4].second = i;
    }
  }
  for (long long i = (1); i <= (4); ++i) {
    for (long long j = (i + 1); j <= (4); ++j) {
      for (long long k = (1); k <= (n); ++k) {
        if (k != p[i].second && k != p[j].second) {
          int _minx = MOD, _miny = MOD, _maxx = -MOD, _maxy = -MOD, temp;
          _minx = min(_minx, p[i].first.first);
          _miny = min(_miny, p[i].first.second);
          _maxx = max(_maxx, p[i].first.first);
          _maxy = max(_maxy, p[i].first.second);
          _minx = min(_minx, p[j].first.first);
          _miny = min(_miny, p[j].first.second);
          _maxx = max(_maxx, p[j].first.first);
          _maxy = max(_maxy, p[j].first.second);
          _minx = min(_minx, x[k]);
          _miny = min(_miny, y[k]);
          _maxx = max(_maxx, x[k]);
          _maxy = max(_maxy, y[k]);
          temp = 2LL * (_maxx - _minx + _maxy - _miny);
          ans = max(ans, temp);
        }
      }
    }
  }
  cout << ans << " ";
  ans = 2LL * (maxx - minx + maxy - miny);
  for (long long i = (4); i <= (n); ++i) cout << ans << " ";
  return 0;
}
