#include <bits/stdc++.h>
using namespace std;
template <class T>
bool umin(T& a, T b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool umax(T& a, T b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
int dis(pair<int, int> x, pair<int, int> y) {
  return abs(x.first - y.first) + abs(x.second - y.second);
}
int main() {
  int n;
  scanf("%d", &n);
  vector<pair<int, int> > v, g;
  v.push_back(make_pair(1000000007, 0));
  v.push_back(make_pair(0, -1000000007));
  v.push_back(make_pair(-1000000007, 0));
  v.push_back(make_pair(0, 1000000007));
  for (int i = 1; i <= n; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    g.push_back(make_pair(x, y));
    if (v[0].first > x) v[0] = make_pair(x, y);
    if (v[1].second < y) v[1] = make_pair(x, y);
    if (v[2].first < x) v[2] = make_pair(x, y);
    if (v[3].second > y) v[3] = make_pair(x, y);
  }
  int ans = 0;
  for (int i = 0; i < int(v.size()); i++)
    for (int j = i + 1; j < int(v.size()); j++)
      for (__typeof((g).begin()) it = (g).begin(); it != (g).end(); it++)
        umax(ans, dis(v[i], v[j]) + dis(v[j], *it) + dis(*it, v[i]));
  printf("%d ", ans);
  for (int i = 4; i <= n; i++)
    printf("%d ",
           2 * (v[2].first - v[0].first) + 2 * (v[1].second - v[3].second));
  puts("");
  return 0;
}
