n = int(input())
cities = list(map(int, input().split()))
print(cities[1] - cities[0], cities[-1] - cities[0])
for i in range(1, n-1):
cost1 = cities[-1] - cities[i]
cost2 = cities[i] - cities[0]
max_cost = cost2 if cost2 > cost1 else cost1
cost1 = cities[i] - cities[i-1]
cost2 = cities[i+1] - cities[i]
min_cost = cost2 if cost2 < cost1 else cost1
print(min_cost, max_cost)
print(cities[-1] - cities[-2], cities[-1] - cities[0])
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define For(i, s, e) for (ll i = s; i < e; i++)
#define FOR(i, s, e) for (ll i = s; i <= e; i++)
#define FORD(i, s, e) for (ll i = s; i >= e; i--)
#define pb push_back
#define vii vector<ll>
#define makep make_pair
#define vpll vector<pair<ll, ll>>
#define fi first
#define se second
#define sii set<ll>
#define pii pair<int, int>
#define rev(c) reverse(c.begin(), c.end())
#define sortf(c) sort(c.begin(), c.end())
#define sortd(c) sort(c.begin(), c.end(), greater<int>())
#define test() \
int test; \
cin >> test; \
while (test--)
#define fast() \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define sqr(n) (n)*(n)
#define len(s) (s.length())
#define re0 return 0
#define re return
ll const max2d = 1e4 + 7;
ll const N = 1e6 + 7;
ll const inf = 1e9 + 7;
char const nl = '\n';
// ! ¸,ø¤º°`°º¤ø,¸¸,ø¤º° [ нvмegy ] °º¤ø,¸¸,ø¤º°`°º¤ø,¸ roadтoнυe
void solve() {
}
bool check[N];
vii plist;
signed main()
{
fast();
int n;
cin >> n;
vii a(n+1, 0);
FOR(i, 1, n) cin >> a[i];
cout << a[2] - a[1] << " " << a[n] - a[1] << nl;
FOR(i, 2, n-1) {
cout << min(a[i] - a[i-1], a[i+1] - a[i]) << " ";
cout << max(a[i] - a[1], a[n] - a[i]);
cout << nl;
}
cout << a[n] - a[n-1] << " " << a[n] - a[1] << nl;
return 0;
}
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |