Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
A. Lineland Mail

time limit per test

3 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputAll 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

Input

The first line of the input contains integer *n* (2 ≤ *n* ≤ 10^{5}) — the number of cities in Lineland. The second line contains the sequence of *n* distinct integers *x*_{1}, *x*_{2}, ..., *x*_{n} ( - 10^{9} ≤ *x*_{i} ≤ 10^{9}), where *x*_{i} is the *x*-coordinate of the *i*-th city. All the *x*_{i}'s are distinct and follow in ascending order.

Output

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.

Examples

Input

4

-5 -2 2 7

Output

3 12

3 9

4 7

5 12

Input

2

-1 1

Output

2 2

2 2

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/12/2021 16:32:38 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|