#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 2 * 1e5 + 10;
ll res;
ll a[N];
void solve() {
  ll n, t;
  cin >> n;
  vector<ll> v;
  for (int i = 0; i < n; i++) {
    cin >> t;
    v.push_back(t);
  }
  vector<pair<ll, ll>> vp;
  sort(v.begin(), v.end());
  ll mn = *min_element(v.begin(), v.end());
  ll x = v[1] - v[0], z = 0;
  ll y = v[n - 1] - v[0];
  vp.push_back({min(x, y), max(x, y)});
  for (int i = 1; i < n - 1; i++) {
    x = v[i] - v[i - 1];
    t = v[i + 1] - v[i];
    y = v[n - 1] - v[i];
    z = v[i] - v[0];
    vp.push_back({min(x, t), max(y, z)});
  }
  x = v[n - 1] - v[n - 2];
  y = v[n - 1] - v[0];
  vp.push_back({min(x, y), max(x, y)});
  for (auto i : vp) {
    cout << i.first << " " << i.second << endl;
  }
}
int main(int argc, char const *argv[]) {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  ll t = 1;
  while (t--) {
    solve();
  }
}
