#include <bits/stdc++.h>
const long long INF = 1e18;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
using namespace std;
long long x[200005];
int n;
int main() {
  cin >> n;
  for (int i = 0; i < (n); i++) cin >> x[i];
  for (int i = 0; i < (n); i++) {
    long long a, b;
    a = INF, b = 0;
    if (i + 1 != n) a = min(a, abs(x[i] - x[i + 1]));
    if (i) a = min(a, abs(x[i - 1] - x[i]));
    b = max(b, abs(x[0] - x[i]));
    b = max(b, abs(x[i] - x[n - 1]));
    cout << a << " " << b << endl;
  }
  return 0;
}
