#include <bits/stdc++.h>
using namespace std;
template <typename Arg1>
void __f(const char* name, Arg1&& arg1) {
  cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args) {
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << " : " << arg1 << " | ";
  __f(comma + 1, args...);
}
template <typename T1, typename T2>
istream& operator>>(istream& in, pair<T1, T2>& a) {
  in >> a.first >> a.second;
  return in;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& out, pair<T1, T2> a) {
  out << a.first << " " << a.second;
  return out;
}
template <typename T, typename T1>
T amax(T& a, T1 b) {
  if (b > a) a = b;
  return a;
}
template <typename T, typename T1>
T amin(T& a, T1 b) {
  if (b < a) a = b;
  return a;
}
const long long INF = 1e18;
const int32_t M = 1e9 + 7;
const int32_t MM = 998244353;
const long long N = 0;
void solve() {
  long long n;
  cin >> n;
  long long x[n], y[n];
  long long maxx = -INF, maxy = -INF, minx = INF, miny = INF;
  for (long long i = 0; i < n; ++i) {
    cin >> x[i] >> y[i];
    amax(maxx, x[i]);
    amax(maxy, y[i]);
    amin(minx, x[i]);
    amin(miny, y[i]);
  }
  long long ans = 0;
  for (long long mask = 0; mask < 64; ++mask) {
    long long c[6] = {0};
    for (long long j = 0; j < 6; ++j) {
      if (mask >> j & 1) {
        c[(j / 3) + 2 * ((j % 3) % 2)] += 1;
        c[(j / 3) + 2 + 2 * ((j % 3) > 0)] -= 1;
      } else {
        c[(j / 3) + 2 * ((j % 3) % 2)] -= 1;
        c[(j / 3) + 2 + 2 * ((j % 3) > 0)] += 1;
      }
    }
    long long dp[n + 1][4];
    fill(dp[0], dp[0] + (n + 1) * 4, -INF);
    dp[0][0] = 0;
    for (long long i = 0; i < n; ++i) {
      for (long long j = 0; j < 4; ++j) {
        amax(dp[i + 1][j], dp[i][j]);
        if (j < 3)
          amax(dp[i + 1][j + 1],
               dp[i][j] + c[2 * j] * x[i] + c[2 * j + 1] * y[i]);
      }
    }
    amax(ans, dp[n][3]);
  }
  cout << ans << " ";
  for (long long i = 4; i <= n; ++i) {
    cout << 2 * (maxx - minx + maxy - miny) << " \n"[i == n];
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) solve();
  return 0;
}
