#include <bits/stdc++.h>
int max(int a, int b) {
  if (a > b) return a;
  return b;
}
int min(int a, int b) {
  if (a < b) return a;
  return b;
}
int main(void) {
  int n, d[100002] = {};
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", d + i);
  d[0] = (d[1] << 1) - d[2];
  d[n + 1] = (d[n] << 1) - d[n - 1];
  for (int i = 1; i <= n; i++)
    printf("%d %d\n", min(d[i + 1] - d[i], d[i] - d[i - 1]),
           max(d[n] - d[i], d[i] - d[1]));
  return 0;
}
