#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 20;
int ans, a, m, n;
long long ps0[N], ps1[N], arr[N], inf = 1e10 + 100;
int main() {
  ios::sync_with_stdio(0), cin.tie(0);
  cin >> n >> arr[0];
  arr[n] = inf;
  ps0[0] = 0;
  for (int i = 1; i < n; i++) {
    cin >> arr[i];
    ps0[i] = ps0[i - 1] + arr[i] - arr[i - 1];
  }
  ps1[n - 1] = 0;
  for (int i = n - 2; i >= 0; i--) {
    ps1[i] = arr[i + 1] - arr[i] + ps1[i + 1];
  }
  cout << arr[1] - arr[0] << " " << ps1[0] << endl;
  for (int i = 1; i < n; i++) {
    cout << min(arr[i] - arr[i - 1], arr[i + 1] - arr[i]) << " "
         << max(ps0[i], ps1[i]) << endl;
  }
}
