#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
constexpr long long int MOD = 1000000007;
void solve() {
  int n;
  cin >> n;
  vector<long long> a(n);
  for (auto &x : a) cin >> x;
  vector<long long> ans(n);
  for (int i = 0; i < n; i++) {
    if (i == 0) {
      cout << abs(a[i + 1] - a[i]) << " " << abs(a[n - 1] - a[i]) << "\n";
    } else if (i == n - 1) {
      cout << abs(a[i] - a[i - 1]) << " " << abs(a[i] - a[0]) << "\n";
    } else {
      ll mint = min(abs(a[i + 1] - a[i]), abs(a[i - 1] - a[i]));
      ll maxt = max(abs(a[i] - a[0]), abs(a[i] - a[n - 1]));
      cout << mint << " " << maxt << "\n";
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t{1};
  while (t--) {
    solve();
  }
}
