Warm-up round completed

Tasks

Show one task per page / all tasks on one page

"A" Spaceship
Time limit 2 seconds
Memory limit 256 megabytes

Space Ranger is caught at an alien spaceship. He is surrounded by enemies. To break free he needs to destroy all enemies in some particular order.

There are n enemies around Space Ranger, the i-th of them has power fi. To break free Space Ranger needs to destroy all enemies in such order, that the power of the last destroyed enemy is equal to the sum of powers of all other enemies.

Space Ranger is short of time, so he has failed to find the required order. Help him! Find the way to destroy all enemies and break free.

Input format

The first line of input contains n — the number of enemies (2 ≤ n ≤ 105).

The second line contains n integers fi — powers of the enemies ( - 109 ≤ fi ≤ 109).

Output format

Output values fi in order in which the enemies must be destroyed. If there are several ways to destroy all enemies and break free, print any one. It is guaranteed that there is at least one way to do it.

Examples
Input data
3
2 5 3
Output data
2 3 5
Input data
5
-1 1 0 1 -1
Output data
-1 1 1 -1 0
 

Send solution

Upload Maximal size is 256kb

Log in

VK Facebook

Forgot password?

Registration

The instruction for password recovery
has been sent to your email