#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll dist(pair<ll, ll> a, pair<ll, ll> b) {
  return abs(a.first - b.first) + abs(a.second - b.second);
}
int x[300005], y[300005], n;
int dp[300005][(1 << 3) + 5];
int solve() {
  int res = 0;
  for (int signmask = 0; signmask < (1 << 6); signmask++) {
    vector<vector<int>> v(3, vector<int>(2, 0));
    for (int i = 0; i < 6; i++) {
      if ((1 << i) & signmask) {
        v[i / 2][i % 2]--;
        v[((i / 2) + 1) % 3][i % 2]++;
      } else {
        v[i / 2][i % 2]++;
        v[((i / 2) + 1) % 3][i % 2]--;
      }
    }
    for (int i = 0; i < n; i++)
      for (int j = 0; j < (1 << 3); j++) dp[i][j] = -1e9;
    dp[0][0] = 0;
    for (int i = 0; i < n; i++)
      for (int j = 0; j < (1 << 3); j++) {
        dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);
        for (int k = 0; k < 3; k++) {
          if ((1 << k) & j) continue;
          int custo = v[k][0] * x[i] + v[k][1] * y[i];
          dp[i + 1][j | (1 << k)] =
              max(dp[i + 1][j | (1 << k)], dp[i][j] + custo);
        }
      }
    res = max(res, dp[n][(1 << 3) - 1]);
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n;
  for (int i = 0; i < n; i++) cin >> x[i] >> y[i];
  ll tot = dist(pair<ll, ll>(x[n - 1], y[n - 1]), pair<ll, ll>(x[0], y[0]));
  for (int i = 0; i < n - 1; i++)
    tot += dist(pair<ll, ll>(x[i], y[i]), pair<ll, ll>(x[i + 1], y[i + 1]));
  ll res = solve();
  cout << res << ' ';
  for (int i = 4; i <= n; i++) cout << tot << ' ';
  cout << endl;
  return 0;
}
