#include <bits/stdc++.h>
using namespace std;
int N, arr[100002], arr2[100002], maxi[100002], mini[100002];
int main() {
  scanf("%d", &N);
  for (int i = 0; i < N; i++) scanf("%d", &arr[i]);
  for (int i = 0; i < N; i++) {
    maxi[i] = max(abs(arr[i] - arr[0]), abs(arr[i] - arr[N - 1]));
    mini[i] = 1e9 * 2 + 5;
    if (i) mini[i] = min(mini[i], abs(arr[i] - arr[i - 1]));
    if (i + 1 < N) mini[i] = min(mini[i], abs(arr[i] - arr[i + 1]));
  }
  for (int i = 0; i < N; i++) printf("%d %d\n", mini[i], maxi[i]);
}
