#include <bits/stdc++.h>
using namespace std;
const int maxn = 500500;
long long x[maxn];
long long y[maxn];
long long exx[maxn];
long long exy[maxn];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> x[i] >> y[i];
    if (i == 0) {
      exx[0] = exx[1] = exx[2] = exx[3] = x[i];
      exy[0] = exy[1] = exy[2] = exy[3] = y[i];
    } else {
      if (x[i] > exx[0]) {
        exx[0] = x[i];
        exy[0] = y[i];
      }
      if (y[i] < exy[1]) {
        exx[1] = x[i];
        exy[1] = y[i];
      }
      if (x[i] < exx[2]) {
        exx[2] = x[i];
        exy[2] = y[i];
      }
      if (y[i] > exy[3]) {
        exx[3] = x[i];
        exy[3] = y[i];
      }
    }
  }
  long long fall = abs(exx[0] - exx[2]) * 2 + abs(exy[1] - exy[3]) * 2;
  bool corner = false;
  for (int i = 0; i < 4; ++i) {
    int j = (i + 1) % 4;
    if (exx[i] == exx[j] && exy[i] == exy[j]) {
      corner = true;
      break;
    }
  }
  long long f3;
  if (corner)
    f3 = fall;
  else {
    f3 = -1;
    for (int i = 0; i < 4; ++i)
      for (int j = i + 1; j < 4; ++j) {
        for (int t = 0; t < n; ++t) {
          if (x[t] == exx[i] && y[t] == exy[i]) continue;
          if (x[t] == exx[j] && y[t] == exy[j]) continue;
          long long minx = min(min(exx[i], exx[j]), x[t]);
          long long maxx = max(max(exx[i], exx[j]), x[t]);
          long long miny = min(min(exy[i], exy[j]), y[t]);
          long long maxy = max(max(exy[i], exy[j]), y[t]);
          long long per = abs(minx - maxx) * 2 + abs(miny - maxy) * 2;
          f3 = max(per, f3);
        }
      }
  }
  cout << f3 << ' ';
  for (int i = 4; i <= n; ++i) cout << fall << ' ';
  cout << endl;
}
