#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 6;
int x[maxn], y[maxn];
const long long mod = 1e9 + 7;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  int u, d, l, r;
  int v[5];
  v[1] = v[4] = -1e9;
  v[2] = v[3] = 1e9;
  for (int i = 1; i <= n; i++) {
    cin >> x[i] >> y[i];
    if (x[i] > v[4]) r = i, v[4] = x[i];
    if (x[i] < v[3]) l = i, v[3] = x[i];
    if (y[i] > v[1]) u = i, v[1] = y[i];
    if (y[i] < v[2]) d = i, v[2] = y[i];
  }
  if (u != l && l != r && r != d) {
    int ans = -1e9;
    for (int i = 1; i <= n; i++) {
      ans = max(ans, 2 * (x[r] - x[i] + y[i] - y[d]));
      ans = max(ans, 2 * (x[r] - x[i] + y[u] - y[i]));
      ans = max(ans, 2 * (x[i] - x[l] + y[i] - y[d]));
      ans = max(ans, 2 * (x[i] - x[l] + y[u] - y[i]));
    }
    printf("%d%c", ans, (n == 3 ? '\n' : ' '));
    ans = 2 * (x[r] - x[l] + y[u] - y[d]);
    for (int i = 4; i <= n; i++) printf("%d%c", ans, (i == n ? '\n' : ' '));
  } else {
    int ans = 2 * (x[r] - x[l] + y[u] - y[d]);
    for (int i = 3; i <= n; i++) printf("%d%c", ans, (i == n ? '\n' : ' '));
  }
}
