#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const long long inf = 4e18 + 5;
long long gcd(long long x, long long y) {
  while (y) x %= y, swap(x, y);
  return x;
}
pair<long long, long long> operator+(pair<long long, long long> a,
                                     pair<long long, long long> b) {
  return pair<long long, long long>(a.first + b.first, a.second + b.second);
}
pair<long long, long long> operator-(pair<long long, long long> a,
                                     pair<long long, long long> b) {
  return pair<long long, long long>(a.first - b.first, a.second - b.second);
}
long long operator*(pair<long long, long long> a,
                    pair<long long, long long> b) {
  return a.first * b.second - a.second * b.first;
}
template <class T>
int sign(T x) {
  return x < 0 ? -1 : x > 0 ? 1 : 0;
}
int ccw(pair<long long, long long> a, pair<long long, long long> b,
        pair<long long, long long> c) {
  return sign((b - a) * (c - b));
}
template <class T>
void setmin(T &x, T y) {
  if (x > y) x = y;
}
template <class T>
void setmax(T &x, T y) {
  if (x < y) x = y;
}
template <class T>
void addval(T &x, T y) {
  x += y;
  x %= mod;
}
int n;
pair<int, int> ps[300005];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  int Fmx = -mod, Fmn = mod, Smx = -mod, Smn = mod;
  for (int i = 1; i <= n; i++) {
    cin >> ps[i].first >> ps[i].second;
    setmax(Fmx, ps[i].first);
    setmin(Fmn, ps[i].first);
    setmax(Smx, ps[i].second);
    setmin(Smn, ps[i].second);
  }
  int ans4 = (Fmx + Smx - Fmn - Smn) * 2;
  int ans3 = 0;
  for (int i = 1; i <= n; i++) {
    int F, S;
    tie(F, S) = ps[i];
    setmax(ans3, Fmx - F + Smx - S);
    setmax(ans3, Fmx - F + S - Smn);
    setmax(ans3, F - Fmn + Smx - S);
    setmax(ans3, F - Fmn + S - Smn);
  }
  ans3 *= 2;
  cout << ans3;
  for (int i = 4; i <= n; i++) cout << ' ' << ans4;
  return 0;
}
