#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, nn[100002];
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &nn[i]);
  nn[0] = nn[1];
  nn[n + 1] = nn[n];
  printf("%d %d\n", nn[2] - nn[1], nn[n] - nn[1]);
  for (int i = 2; i < n; i++) {
    int minn = min(nn[i] - nn[i - 1], nn[i + 1] - nn[i]);
    int maxx = max(nn[n + 1] - nn[i], nn[i] - nn[0]);
    printf("%d %d\n", minn, maxx);
  }
  printf("%d %d\n", nn[n] - nn[n - 1], nn[n] - nn[1]);
  return 0;
}
