#include <bits/stdc++.h>
using namespace std;
int main() {
  vector<long long> c;
  int n, temp, minm, maxm;
  cin >> n;
  c.push_back(LLONG_MIN);
  for (int i = 0; i < n; i++) {
    cin >> temp;
    c.push_back(temp);
  }
  c.push_back(LLONG_MAX);
  for (int i = 1; i < n + 1; i++) {
    minm = min(abs(c.at(i) - c.at(i - 1)), abs(c.at(i) - c.at(i + 1)));
    maxm = max(abs(c.at(i) - c.at(n)), abs(c.at(i) - c.at(1)));
    if (i == n) maxm = abs(c.at(n) - c.at(1));
    cout << minm << " " << maxm << endl;
  }
}
