#include <bits/stdc++.h>
using namespace std;
const int maxn = 233333;
const int inf = 2e9 + 1e8;
int a[maxn];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
  for (int i = 1; i <= n; ++i) {
    printf("%d %d\n",
           min(i < n ? a[i + 1] - a[i] : inf, i > 1 ? a[i] - a[i - 1] : inf),
           max(a[n] - a[i], a[i] - a[1]));
  }
  return 0;
}
