eolymp
bolt
Try our new interface for solving problems
Problems

Sorting

Sorting

Time limit 1 second
Memory limit 128 MiB

Sort the array of integers in non-increasing order.

Input data

The first line contains the size of the array n~(1 \le n \le 1000). The second line contains n integers, not exceeding 2 \cdot 10^9 in absolute value.

Output data

Print the given numbers in non-increasing order.

Examples

Input example #1
5
9 2 7 1 2
Output example #1
9 7 2 2 1