#include <bits/stdc++.h>
using namespace std;
int a[100005];
int main() {
  int n;
  while (~scanf("%d", &n)) {
    for (int i = 0; i < n; i++) {
      scanf("%d", &a[i]);
    }
    printf("%d %d\n", abs(a[0] - a[1]), abs(a[0] - a[n - 1]));
    for (int i = 1; i < n - 1; i++) {
      int t1 = min(abs(a[i] - a[i - 1]), abs(a[i] - a[i + 1]));
      int t2 = max(abs(a[i] - a[0]), abs(a[i] - a[n - 1]));
      printf("%d %d\n", t1, t2);
    }
    printf("%d %d\n", abs(a[n - 1] - a[n - 2]), abs(a[n - 1] - a[0]));
  }
  return 0;
}
