#include <bits/stdc++.h>
using namespace std;
int n;
int x[100000];
int dist(int a, int b) { return abs(a - b); }
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> x[i];
  cout << dist(x[0], x[1]) << ' ' << dist(x[0], x[n - 1]) << endl;
  for (int i = 1; i < n - 1; i++)
    cout << min(dist(x[i], x[i - 1]), dist(x[i], x[i + 1])) << ' '
         << max(dist(x[i], x[0]), dist(x[i], x[n - 1])) << endl;
  cout << dist(x[n - 1], x[n - 2]) << ' ' << dist(x[0], x[n - 1]) << endl;
  return 0;
}
