#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int MAX = INT_MAX, MIN = INT_MIN;
int gcd(int a, int b) { return (b ? gcd(b, a % b) : a); }
int mod(int n) {
  while (n < 0) n += MOD;
  return n % MOD;
}
const int N = 3e5 + 20;
pair<int, int> p[N];
int32_t main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int n, minx = MAX, maxx = MIN, miny = MAX, maxy = MIN;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> p[i].first >> p[i].second;
    minx = min(minx, p[i].first);
    miny = min(miny, p[i].second);
    maxx = max(maxx, p[i].first);
    maxy = max(maxy, p[i].second);
  }
  int mx = MIN;
  for (int i = 0; i < n; i++)
    mx = max(mx, max(abs(maxx - p[i].first), abs(minx - p[i].first)) +
                     max(abs(maxy - p[i].second), abs(miny - p[i].second)));
  cout << 2 * mx << " ";
  for (int i = 4; i < n + 1; i++)
    cout << 2 * (maxx - minx + maxy - miny) << " ";
  cout << "\n";
  return 0;
}
