#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
template <typename T>
constexpr int infValue =
    std::is_same<T, int>::value ? 2000100007 : 8600000000000000007ll;
template <typename T>
constexpr int maxValue =
    std::is_same<T, int>::value ? 1000000007 : 1000000000000000001ll;
const int INF = infValue<int>;
const long long MOD = 998244353ll;
const double EPS = 1e-6;
const int MAX = maxValue<int>;
using pr = pair<int, int>;
int min_X = INF, max_X = -INF, min_Y = INF, max_Y = -INF;
int n, x[301000], y[301000];
long long p;
int main(void) {
  scanf("%d", &n);
  for (register int i = 0; i < n; ++i) scanf("%d %d", x + i, y + i);
  for (register int i = 0; i < n; ++i) {
    min_X = min(min_X, x[i]);
    min_Y = min(min_Y, y[i]);
    max_X = max(max_X, x[i]);
    max_Y = max(max_Y, y[i]);
  }
  for (register int i = 0; i < n; ++i) {
    p = max(p, abs(x[i] - min_X) + abs(y[i] - min_Y) + 0ll);
    p = max(p, abs(x[i] - min_X) + abs(y[i] - max_Y) + 0ll);
    p = max(p, abs(x[i] - max_X) + abs(y[i] - min_Y) + 0ll);
    p = max(p, abs(x[i] - max_X) + abs(y[i] - max_Y) + 0ll);
  }
  printf("%lld ", p * 2ll);
  p = abs(max_X - min_X) * 2ll + abs(max_Y - min_Y) * 2ll;
  for (register int i = 4; i <= (n); ++i) {
    printf("%lld ", p);
  }
  putc('\n', stdout);
  return 0;
}
