#include <bits/stdc++.h>
using namespace std;
long long int N = 0, rightmost = 0, leftmost = 0;
long long int max_dist = 0, min_dist = INT_MAX;
int main() {
  scanf("%lld\n", &N);
  long long int city[N];
  for (int i = 0; i < N; i++) {
    scanf("%lld", &city[i]);
  }
  rightmost = city[0];
  leftmost = city[N - 1];
  for (int i = 0; i < N; i++) {
    max_dist = max(abs(city[i] - leftmost), abs(city[i] - rightmost));
    if (i + 1 == N)
      min_dist = abs(city[i] - city[i - 1]);
    else if (i - 1 == -1)
      min_dist = abs(city[i] - city[i + 1]);
    else
      min_dist = min(abs(city[i] - city[i - 1]), abs(city[i] - city[i + 1]));
    printf("%lld %lld\n", min_dist, max_dist);
  }
  return 0;
}
