#include <bits/stdc++.h>
using namespace std;
const int N = 2000010, mod = 1e9 + 7;
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 1) + (x << 3) + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
void solve() {}
pair<int, int> p[N];
bool cmp(pair<int, int> a, pair<int, int> b) { return a.second < b.second; }
int main() {
  int n = read();
  int lx = 1e8, rx = -1e8, uy = -1e8, dy = 1e8;
  for (int i = 1; i <= n; ++i) {
    p[i].first = read(), p[i].second = read();
    lx = min(lx, p[i].first);
    rx = max(rx, p[i].first);
    uy = max(uy, p[i].second);
    dy = min(dy, p[i].second);
  }
  int ans = 0;
  for (int i = 1; i <= n; ++i) {
    ans = max(ans, rx - p[i].first + p[i].second - dy);
    ans = max(ans, p[i].first - lx + p[i].second - dy);
    ans = max(ans, rx - p[i].first + uy - p[i].second);
    ans = max(ans, p[i].first - lx + uy - p[i].second);
  }
  cout << ans * 2 << ' ';
  for (int i = 4; i <= n; ++i) cout << (uy - dy + rx - lx) * 2 << ' ';
  return 0;
}
