CF567A.Lineland Mail

All cities of Lineland are located on the Ox coordinate axis. Thus, each city is associated with its position x__i — a coordinate on the Ox axis. No two cities are located at a single point.

Lineland residents love to send letters to each other. A person may send a letter only if the recipient lives in another city (because if they live in the same city, then it is easier to drop in).

Strange but true, the cost of sending the letter is exactly equal to the distance between the sender's city and the recipient's city.

For each city calculate two values min__i and max__i, where min__i is the minimum cost of sending a letter from the i-th city to some other city, and max__i is the the maximum cost of sending a letter from the i-th city to some other city

Lineland 的所有城市都位于 $Ox$ 坐标轴上。因此，每个城市对应一个位置 $x_i$ —— 即 $Ox$ 轴上的一个坐标。任意两个城市均不位于同一点。

Lineland 的居民热衷于互相寄送信件。一个人仅可在收件人居住于另一座城市时寄出信件（因为若双方居住于同一座城市，则当面拜访更为便捷）。

尽管看似奇怪，但寄送信件的费用恰好等于发件人所在城市与收件人所在城市之间的距离。

对每座城市，计算两个值 $min_i$ 和 $max_i$，其中 $min_i$ 表示从第 $i$ 座城市向其他某座城市寄信的最小费用，而 $max_i$ 表示从第 $i$ 座城市向其他某座城市寄信的最大费用。

The first line of the input contains integer n (2 ≤ n ≤ 105) — the number of cities in Lineland. The second line contains the sequence of n distinct integers _x_1, _x_2, ..., x__n ( - 109 ≤ x__i ≤ 109), where x__i is the x-coordinate of the i-th city. All the x__i's are distinct and follow in ascending order.

输入的第一行包含一个整数 $n$（$2 \leq n \leq 10^5$）—— 表示 Lineland 中城市的数量。
第二行包含一个由 $n$ 个互不相同的整数 $x_1,\,x_2,\,\dots,\,x_n$（$-10^9 \leq x_i \leq 10^9$）组成的序列，其中 $x_i$ 表示第 $i$ 座城市的 $x$ 坐标。所有 $x_i$ 互不相同，且按升序排列。

Print n lines, the i-th line must contain two integers min__i, max__i, separated by a space, where min__i is the minimum cost of sending a letter from the i-th city, and max__i is the maximum cost of sending a letter from the i-th city.

输出 n 行，其中第 i 行必须包含两个整数 min__i 和 max__i（以空格分隔），其中 min__i 表示从第 i 个城市寄送一封信的最小花费，max__i 表示从第 i 个城市寄送一封信的最大花费。