#include <bits/stdc++.h>
using namespace std;
const int MAXN = 3e5 + 5;
const long long inf = (1LL << 30);
long long n, x[MAXN], y[MAXN];
set<pair<long long, long long> > sx, sy;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> x[i] >> y[i];
    sx.insert(pair<long long, long long>(x[i], i));
    sy.insert(pair<long long, long long>(y[i], i));
  }
  long long maxx = -inf, minx = inf, maxy = -inf, miny = inf;
  for (int i = 0; i < n; ++i) {
    maxx = max(x[i], maxx);
    maxy = max(y[i], maxy);
    minx = min(x[i], minx);
    miny = min(y[i], miny);
  }
  long long ans = 0;
  for (int i = 0; i < n; ++i) {
    sx.erase(pair<long long, long long>(x[i], i));
    sy.erase(pair<long long, long long>(y[i], i));
    auto minsx = (*sx.begin()), maxsx = (*sx.rbegin()), minsy = (*sy.begin()),
         maxsy(*sy.rbegin());
    ans = max(ans, max(abs(x[i] - minsx.first), abs(x[i] - maxsx.first)) +
                       max(abs(y[i] - minsy.first), abs(y[i] - maxsy.first)));
    sx.insert(pair<long long, long long>(x[i], i));
    sy.insert(pair<long long, long long>(y[i], i));
  }
  cout << 2 * ans << ' ';
  for (int i = 4; i <= n; ++i) cout << 2 * (maxx + maxy - minx - miny) << ' ';
  cout << "\n";
}
