#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000000000018;
const size_t SIZE = 300005;
unsigned int n;
pair<long long, long long> p[SIZE];
long long max_y = -INF, max_x = -INF, min_y = INF, min_x = INF;
long long max_y_ind, max_x_ind, min_y_ind, min_x_ind;
int main() {
  cin.tie();
  ios_base::sync_with_stdio(0);
  cin >> n;
  long long x, y;
  for (unsigned int i = 0; i < n; ++i) {
    cin >> x >> y;
    p[i] = make_pair(x, y);
    if (x > max_x) {
      max_x = max(max_x, x);
      max_x_ind = i;
    }
    if (y > max_y) {
      max_y = max(max_y, y);
      max_y_ind = i;
    }
    if (x < min_x) {
      min_x = min(min_x, x);
      min_x_ind = i;
    }
    if (y < min_y) {
      min_y = min(min_y, y);
      min_y_ind = i;
    }
  }
  long long big_ans = max_x + max_y - min_x - min_y;
  if (n == 3) {
    cout << 2 * big_ans << " ";
    return 0;
  }
  long long small_ans = -INF;
  long long cur_ans;
  for (unsigned int i = 0; i < n; ++i) {
    if (i != min_x_ind && i != min_y_ind) {
      cur_ans = p[i].first - min_x + p[i].second - min_y;
      small_ans = max(small_ans, cur_ans);
    }
  }
  for (unsigned int i = 0; i < n; ++i) {
    if (i != max_x_ind && i != min_y_ind) {
      cur_ans = max_x - p[i].first + p[i].second - min_y;
      small_ans = max(small_ans, cur_ans);
    }
  }
  for (unsigned int i = 0; i < n; ++i) {
    if (i != min_x_ind && i != max_y_ind) {
      cur_ans = p[i].first - min_x + max_y - p[i].second;
      small_ans = max(small_ans, cur_ans);
    }
  }
  for (unsigned int i = 0; i < n; ++i) {
    if (i != max_x_ind && i != max_y_ind) {
      cur_ans = max_x - p[i].first + max_y - p[i].second;
      small_ans = max(small_ans, cur_ans);
    }
  }
  cout << 2 * small_ans << " ";
  for (unsigned int i = 4; i <= n; ++i) {
    cout << 2 * big_ans << " ";
  }
  return 0;
}
