#include <bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast", "unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
const long long inf = numeric_limits<long long>::max() / 5;
const long double eps = 1e-9;
const long double pi = acos(-1);
template <typename T>
inline bool mineq(T& a, T b) {
  return (a > b) ? (a = b, 1) : 0;
}
template <typename T>
inline bool maxeq(T& a, T b) {
  return (a < b) ? (a = b, 1) : 0;
}
inline void solve(), read();
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  ;
  read();
  solve();
  return 0;
}
long long n;
vector<pair<long long, long long> > a;
vector<long long> p, q, r;
vector<long long> dp, prv;
pair<long long, long long> f[4];
long long bounding() {
  long long minx = inf, miny = inf;
  long long maxx = -inf, maxy = -inf;
  for (long long i = 0; i < n; i++) {
    if (mineq(minx, a[i].first)) {
      f[0] = a[i];
    }
    if (maxeq(maxx, a[i].first)) {
      f[1] = a[i];
    }
    if (mineq(miny, a[i].second)) {
      f[2] = a[i];
    }
    if (maxeq(maxy, a[i].second)) {
      f[3] = a[i];
    }
  }
  return 2 * (maxx - minx + maxy - miny);
}
long long triangle() {
  long long ans = 0;
  for (long long i = 0; i < 4; i++) {
    for (long long j = 0; j < 4; j++) {
      if (i == j) {
        continue;
      }
      for (long long k = 0; k < n; k++) {
        if (f[i] == a[k] || f[j] == a[k]) {
          continue;
        }
        maxeq(
            ans,
            abs(f[i].first - f[j].first) + abs(f[i].second - f[j].second) +
                abs(f[i].first - a[k].first) + abs(f[i].second - a[k].second) +
                abs(f[j].first - a[k].first) + abs(f[j].second - a[k].second));
      }
    }
  }
  return ans;
}
inline void solve() {
  long long f4 = bounding();
  long long f3 = triangle();
  cout << f3 << " ";
  for (long long i = 4; i <= n; i++) {
    cout << f4 << " ";
  }
  cout << "\n";
}
inline void read() {
  cin >> n;
  a.resize(n);
  for (long long i = 0; i < n; i++) {
    cin >> a[i].first >> a[i].second;
  }
}
