#include <bits/stdc++.h>
using namespace std;
bool cmpX(pair<long long, long long> a, pair<long long, long long> b) {
  return a.first < b.first;
}
bool cmpY(pair<long long, long long> a, pair<long long, long long> b) {
  return a.second < b.second;
}
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  vector<pair<long long, long long>> arr(n);
  const long long inf = 1e9;
  long long x, y;
  long long maxX = -inf, minX = inf;
  long long maxY = -inf, minY = inf;
  for (long long i = 0; i < n; ++i) {
    cin >> x >> y;
    arr[i] = {x, y};
    maxX = max(maxX, x);
    minX = min(minX, x);
    maxY = max(maxY, y);
    minY = min(minY, y);
  }
  long long sum = 0;
  for (long long i = 0; i < n; ++i) {
    sum += abs(arr[i].first - arr[(i + 1) % n].first);
    sum += abs(arr[i].second - arr[(i + 1) % n].second);
  }
  vector<long long> res(n + 1, 0);
  for (long long i = 4; i <= n; ++i) {
    res[i] = 2 * (maxX - minX + maxY - minY);
    res[i] = sum;
  }
  set<pair<long long, long long>> st;
  sort(arr.begin(), arr.end(), cmpX);
  const long long Bound = 5;
  for (long long i = 0; i < n && i < Bound; ++i) {
    st.insert(arr[i]);
  }
  for (long long i = n - 1; i >= 0 && i >= n - Bound; --i) {
    st.insert(arr[i]);
  }
  sort(arr.begin(), arr.end(), cmpY);
  for (long long i = 0; i < n && i < Bound; ++i) {
    st.insert(arr[i]);
  }
  for (long long i = n - 1; i >= 0 && i >= n - Bound; --i) {
    st.insert(arr[i]);
  }
  vector<pair<long long, long long>> three;
  for (auto &p : st) three.push_back(p);
  for (long long i = 0; i < n; ++i) {
    for (long long j = 0; j < three.size(); ++j) {
      for (long long k = j + 1; k < three.size(); ++k) {
        long long sum = abs(arr[i].first - three[j].first);
        sum += abs(arr[i].second - three[j].second);
        sum += abs(arr[i].first - three[k].first);
        sum += abs(arr[i].second - three[k].second);
        sum += abs(three[j].first - three[k].first);
        sum += abs(three[j].second - three[k].second);
        res[3] = max(res[3], sum);
      }
    }
  }
  for (long long i = 3; i <= n; ++i) {
    cout << res[i] << ' ';
  }
  cout << '\n';
  return 0;
}
