#include <bits/stdc++.h>
using namespace std;
int n;
long long city[100005];
int main() {
  while (cin >> n) {
    if (n == 0 || n == 1) {
      break;
    }
    for (int i = 1; i <= n; i++) {
      cin >> city[i];
    }
    int max1, max2, max, min, min1, min2;
    cout << city[2] - city[1] << " " << city[n] - city[1] << endl;
    for (int j = 2; j < n; j++) {
      max1 = city[j] - city[1];
      max2 = city[n] - city[j];
      max = (max1 > max2) ? max1 : max2;
      min1 = city[j] - city[j - 1];
      min2 = city[j + 1] - city[j];
      min = (min1 < min2) ? min1 : min2;
      cout << min << " " << max << endl;
    }
    cout << city[n] - city[n - 1] << " " << city[n] - city[1] << endl;
  }
  return 0;
}
