#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  int a[n];
  for (int i = 0; i < n; ++i) cin >> a[i];
  sort(a, a + n);
  long long mx = INT_MAX;
  long long mn = 0;
  cout << abs(a[1] - a[0]) << " " << abs(a[n - 1] - a[0]) << endl;
  for (int i = 1; i < n - 1; ++i) {
    cout << min(abs(a[i] - a[i + 1]), abs(a[i - 1] - a[i])) << " "
         << max(abs(a[0] - a[i]), abs(a[n - 1] - a[i])) << endl;
  }
  cout << abs(a[n - 2] - a[n - 1]) << " " << abs(a[n - 1] - a[0]) << endl;
}
int main() {
  solve();
  return 0;
}
