#include <bits/stdc++.h>
using namespace std;
inline long long mod(long long n, long long m) {
  long long ret = n % m;
  if (ret < 0LL) ret += m;
  return ret;
}
long long gcd(long long a, long long b) { return (b == 0 ? a : gcd(b, a % b)); }
long long exp(long long a, long long b, long long m) {
  if (b == 0LL) return 1LL;
  if (b == 1LL) return mod(a, m);
  long long k = mod(exp(a, b / 2, m), m);
  if (b & 1LL) {
    return mod(a * mod(k * k, m), m);
  } else
    return mod(k * k, m);
}
const long long MAXN = 300100;
long long res[MAXN];
pair<long long, long long> P[MAXN];
long long dist(pair<long long, long long> a, pair<long long, long long> b) {
  return abs(a.first - b.first) + abs(a.second - b.second);
}
long long n;
long long dp[MAXN][3][4][4];
const long long inf = 2e9;
long long solve(long long id, long long j, long long xo, long long yo) {
  if (j == 3) {
    if (xo == 3 && yo == 3) return 0;
    return -inf;
  }
  if (id == n + 1) {
    return -inf;
  }
  long long &x = dp[id][j][xo][yo];
  if (x != -1) return x;
  x = 0;
  long long op0 = solve(id + 1, j, xo, yo);
  x = op0;
  for (long long it1 = 0; it1 <= 2; it1++) {
    for (long long it2 = 0; it2 <= 2; it2++) {
      long long sum1 = it1 * P[id].first - (2 - it1) * P[id].first;
      long long sum2 = it2 * P[id].second - (2 - it2) * P[id].second;
      if (it1 + xo <= 3 && it2 + yo <= 3) {
        x = max(x, sum1 + sum2 + solve(id + 1, j + 1, xo + it1, yo + it2));
      }
    }
  }
  return x;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n;
  for (long long i = 1; i <= n; i++) {
    cin >> P[i].first >> P[i].second;
  }
  memset(dp, -1, sizeof(dp));
  long long tot = 0;
  for (long long i = 1; i <= n; i++) {
    tot += dist(P[i], P[(i == n ? 1 : i + 1)]);
  }
  cout << solve(1, 0, 0, 0) << " ";
  for (long long i = 4; i <= n; i++) cout << tot << " ";
  cout << "\n";
}
