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

The first line of the input contains integer n (2 ≤ n ≤ 10⁵) — the number of cities in Lineland. The second line contains the sequence of n distinct integers x₁, x₂, ..., x_n ( - 10⁹ ≤ x_i ≤ 10⁹), where x_i is the x-coordinate of the i-th city. All the x_i's are distinct and follow in ascending order.

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.