#include <bits/stdc++.h>
using namespace std;
long long int n, m, a[1000005];
pair<long long int, long long int> p[1000005];
vector<pair<long long int, long long int> > v[5];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n;
  cin >> n;
  long long int mxx = -1e18 + 5;
  long long int mix = 1e18 + 5;
  long long int mxy = -1e18 + 5;
  long long int miy = 1e18 + 5;
  for (long long int i = 0; i < n; i++) {
    cin >> p[i].first >> p[i].second;
    mxx = max(mxx, p[i].first);
    mxy = max(mxy, p[i].second);
    mix = min(mix, p[i].first);
    miy = min(miy, p[i].second);
  }
  long long int ans = 0;
  for (long long int i = 0; i < n; i++) {
    ans += abs(p[i].first - p[(i + 1) % n].first);
    ans += abs(p[i].second - p[(i + 1) % n].second);
  }
  for (long long int i = 0; i < n; i++) {
    if (p[i].first == mxx) v[1].push_back({p[i].first, p[i].second});
    if (p[i].first == mix) v[2].push_back({p[i].first, p[i].second});
    if (p[i].second == mxy) v[3].push_back({p[i].first, p[i].second});
    if (p[i].second == miy) v[4].push_back({p[i].first, p[i].second});
  }
  sort(v[1].begin(), v[1].end());
  sort(v[2].begin(), v[2].end());
  sort(v[3].begin(), v[3].end());
  sort(v[4].begin(), v[4].end());
  long long int ans1 = 0;
  for (long long int i = 1; i <= 4; i++)
    for (long long int j = 1; j <= 4; j++)
      for (long long int k = 0; k < n; k++) {
        for (long long int ii = 0; ii <= 1; ii++)
          for (long long int ij = 0; ij <= 1; ij++) {
            long long int p1x, p1y;
            long long int p2x, p2y;
            long long int p3x, p3y;
            if (ii == 0)
              p1x = v[i][0].first, p1y = v[i][0].second;
            else
              p1x = v[i].back().first, p1y = v[i].back().second;
            if (ij == 0)
              p2x = v[j][0].first, p2y = v[j][0].second;
            else
              p2x = v[j].back().first, p2y = v[j].back().second;
            p3x = p[k].first;
            p3y = p[k].second;
            if (p1x == p2x && p1y == p2y) continue;
            if (p1x == p3x && p1y == p3y) continue;
            if (p3x == p2x && p3y == p2y) continue;
            long long int temp = abs(p1x - p2x);
            temp += abs(p1y - p2y);
            temp += abs(p2y - p3y);
            temp += abs(p2x - p3x);
            temp += abs(p1y - p3y);
            temp += abs(p1x - p3x);
            ans1 = max(ans1, temp);
          }
      }
  cout << ans1 << " ";
  for (long long int i = 4; i <= n; i++) cout << ans << " ";
  return 0;
}
