#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-8;
inline int max(int a, int b) { return a < b ? b : a; }
inline int min(int a, int b) { return a > b ? b : a; }
inline long long max(long long a, long long b) { return a < b ? b : a; }
inline long long min(long long a, long long b) { return a > b ? b : a; }
const int mod = 1e9 + 7;
const int N = 1e6 + 10;
const long long inf = 1e18;
long long fl(long long x, long long y) {
  if (x >= 0) return x / y;
  return x / y - (x % y ? 1 : 0);
}
long long cl(long long x, long long y) {
  if (x >= 0) return (x + y - 1) / y;
  return x / y;
}
long long A[N];
map<long long, int> M, M1;
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%lld", &A[i]);
  }
  for (int i = 0; i < n; ++i) {
    long long a1 = inf, a2 = 0;
    if (i + 1 < n) {
      a1 = min(a1, abs(A[i + 1] - A[i]));
    }
    if (i > 0) {
      a1 = min(a1, abs(A[i - 1] - A[i]));
    }
    if (n - 1 != i) {
      a2 = max(a2, abs(A[n - 1] - A[i]));
    }
    if (i != 0) a2 = max(a2, abs(A[0] - A[i]));
    printf("%lld %lld\n", a1, a2);
  }
  return 0;
}
