#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
using namespace std;
bool is_prime(long long n) {
  if (n <= 1) {
    return false;
  }
  for (long long i = 2; i * i <= n; ++i) {
    if (n % i == 0) {
      return false;
    }
  }
  return true;
}
inline long long getPow(long long a, long long b) {
  long long res = 1ll, tp = a;
  while (b) {
    if (b & 1ll) {
      res *= tp;
    }
    tp *= tp;
    b >>= 1ll;
  }
  return res;
}
long long coso(long long x1, long long y1, long long x2, long long y2,
               long long x3, long long y3) {
  return abs((x2 - x1) * (y3 - y1) - (y2 - y1) * (x3 - x1));
}
inline long long nxt() {
  long long x;
  cin >> x;
  return x;
}
void ok() {
  puts("YES");
  exit(0);
}
void no() {
  puts("NO");
  exit(0);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n = nxt();
  vector<long long> x(n), y(n);
  for (int i = 0; i < n; i++) {
    x[i] = nxt(), y[i] = nxt();
  }
  long long Mx = *max_element(x.begin(), x.end());
  long long mx = *min_element(x.begin(), x.end());
  long long My = *max_element(y.begin(), y.end());
  long long my = *min_element(y.begin(), y.end());
  long long s = Mx + My - mx - my;
  s *= 2;
  vector<pair<long long, long long> > border_x;
  vector<pair<long long, long long> > border_y;
  for (int i = 0; i < n; i++) {
    if (Mx == x[i] || mx == x[i]) {
      border_x.push_back({x[i], y[i]});
    }
    if (My == y[i] || my == y[i]) {
      border_y.push_back({x[i], y[i]});
    }
  }
  long long ans = 0;
  for (auto t1 : border_x) {
    for (auto t2 : border_y) {
      for (int i = 0; i < n; i++) {
        long long Mx_ = max({t1.first, t2.first, x[i]});
        long long mx_ = min({t1.first, t2.first, x[i]});
        long long My_ = max({t1.second, t2.second, y[i]});
        long long my_ = min({t1.second, t2.second, y[i]});
        long long st = 2 * (Mx_ - mx_ + My_ - my_);
        ans = max(ans, st);
      }
    }
  }
  cout << ans << " ";
  for (int i = 0; i < n - 3; i++) {
    cout << s << " ";
  }
  return 0;
}
