#include <bits/stdc++.h>
using namespace std;
mt19937_64 rang(
    chrono::high_resolution_clock::now().time_since_epoch().count());
int rng(int lim) {
  uniform_int_distribution<int> uid(0, lim - 1);
  return uid(rang);
}
const int mod = 1e9 + 7;
void solve() {
  int n;
  cin >> n;
  vector<int> v(n);
  for (int i = 0; i < n; i++) cin >> v[i];
  cout << v[1] - v[0] << " " << v[n - 1] - v[0] << "\n";
  for (int i = 1; i < n - 1; i++) {
    int mn = min(v[i + 1] - v[i], v[i] - v[i - 1]);
    int mx = max(v[i] - v[0], v[n - 1] - v[i]);
    cout << mn << " " << mx << "\n";
  }
  cout << v[n - 1] - v[n - 2] << " " << v[n - 1] - v[0];
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  srand(chrono::high_resolution_clock::now().time_since_epoch().count());
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
