#include <bits/stdc++.h>
using namespace std;
const long long MAX = 3e5 + 10;
const long long MOD = 1e9 + 7;
const long long INF = 0x3f3f3f3f;
const long long LLINF = 0x3f3f3f3f3f3f3f3f;
const long double EPS = 1e-8;
const long double PI = acos(-1);
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  long long n;
  cin >> n;
  vector<pair<long long, long long> > p(n);
  for (long long i = 0; i < n; i++) cin >> p[i].first >> p[i].second;
  long long sz = 0;
  vector<pair<long long, long long> > nlso;
  nlso.push_back({-INF, 0});
  nlso.push_back({0, -INF});
  nlso.push_back({INF, 0});
  nlso.push_back({0, INF});
  for (long long i = 0; i < n; i++) {
    long long lst = (i - 1 + n) % n;
    sz += abs(p[i].first - p[lst].first) + abs(p[i].second - p[lst].second);
    if (p[i].first > nlso[0].first) nlso[0] = p[i];
    if (p[i].second > nlso[1].second) nlso[1] = p[i];
    if (p[i].first < nlso[2].first) nlso[2] = p[i];
    if (p[i].second < nlso[3].second) nlso[3] = p[i];
  }
  long long best = 0;
  for (long long i = 0; i < 4; i++)
    for (long long j = i + 1; j < 4; j++)
      for (long long k = 0; k < n; k++) {
        long long now = abs(nlso[i].first - nlso[j].first) +
                        abs(nlso[i].second - nlso[j].second) +
                        abs(nlso[i].first - p[k].first) +
                        abs(nlso[i].second - p[k].second) +
                        abs(p[k].first - nlso[j].first) +
                        abs(p[k].second - nlso[j].second);
        best = max(best, now);
      }
  cout << best << " ";
  for (long long i = 0; i < n - 3; i++) cout << sz << " ";
  cout << '\n';
  return 0;
}
