#include <bits/stdc++.h>
using namespace std;
int main() {
  int temp = 0;
  int n = 0;
  cin >> n;
  vector<int> city(n);
  for (int i = 0; i < n; ++i) {
    cin >> city[i];
  }
  int max = 0;
  int min = 0;
  for (int j = 0; j < n; ++j) {
    if (j == n - 1) {
      min = abs(city[j] - city[j - 1]);
      max = abs(city[j] - city[0]);
    } else if (j == 0) {
      min = abs(city[0] - city[1]);
      max = abs(city[0] - city[n - 1]);
    } else {
      if (abs(city[j] - city[j + 1]) < abs(city[j] - city[j - 1]))
        min = abs(city[j] - city[j + 1]);
      else if (abs(city[j] - city[j + 1]) >= abs(city[j] - city[j - 1]))
        min = abs(city[j] - city[j - 1]);
      if (abs(city[j] - city[0]) < abs(city[j] - city[n - 1]))
        max = abs(city[j] - city[n - 1]);
      else if (abs(city[j] - city[0]) >= abs(city[j] - city[n - 1]))
        max = abs(city[j] - city[0]);
    }
    cout << min << " " << max << endl;
  }
  return 0;
}
