#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 30;
int a[N];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; ++i) scanf("%d", a + i);
  int mind, maxd;
  printf("%d %d\n", a[1] - a[0], a[n - 1] - a[0]);
  for (int i = 1; i < n - 1; ++i) {
    mind = (a[i] - a[i - 1]) < (a[i + 1] - a[i]) ? (a[i] - a[i - 1])
                                                 : (a[i + 1] - a[i]);
    maxd =
        (a[i] - a[0]) > (a[n - 1] - a[i]) ? (a[i] - a[0]) : (a[n - 1] - a[i]);
    printf("%d %d\n", mind, maxd);
  }
  printf("%d %d\n", a[n - 1] - a[n - 2], a[n - 1] - a[0]);
  return 0;
}
