#include <bits/stdc++.h>
using namespace std;
int n;
long long int f[100010];
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) scanf("%I64d", &f[i]);
  long long int mini, maxi;
  long long int t1, t2, t3, t4;
  maxi = f[n] - f[1];
  mini = f[2] - f[1];
  cout << mini << " " << maxi << endl;
  for (int i = 2; i <= n - 1; i++) {
    t1 = f[i] - f[i - 1];
    t2 = f[i + 1] - f[i];
    if (t1 > t2)
      mini = t2;
    else
      mini = t1;
    t3 = f[i] - f[1];
    t4 = f[n] - f[i];
    if (t3 > t4)
      maxi = t3;
    else
      maxi = t4;
    cout << mini << " " << maxi << endl;
  }
  maxi = f[n] - f[1];
  mini = f[n] - f[n - 1];
  cout << mini << " " << maxi << endl;
  return 0;
}
