#include <bits/stdc++.h>
using namespace std;
map<int, int> mp;
int main() {
  long int n, mn = INT_MAX, mx = INT_MIN, i, x;
  cin >> n;
  vector<long int> v;
  for (i = 0; i < n; i++) {
    cin >> x;
    v.push_back(x);
  }
  for (i = 0; i < n; i++) {
    if (i == n - 1) mn = abs(v[i] - v[i - 1]);
    if (i == 0)
      mn = abs(v[i] - v[i + 1]);
    else if (i != 0 && i != n - 1)
      mn = min(abs(v[i] - v[i - 1]), abs(v[i] - v[i + 1]));
    cout << mn << " ";
    mx = max(abs(v[i] - v[0]), abs(v[i] - v[n - 1]));
    cout << mx << endl;
  }
  return 0;
}
