Reverse the delivery list

Problem

A driver gets the delivery numbers in the order they were booked. Print them in reverse order on one line, separated by spaces.

Input: The first line has n, the number of values. The second line has the n values separated by spaces.
Output: The n numbers in reverse order on one line, separated by single spaces.
Constraints: 1 ≤ n ≤ 1000
1 ≤ each number ≤ 100000

Example

Input

4
101 102 103 104

Output

104 103 102 101

The last booking comes first.

Try the problem first. Open one hint at a time.

Hint 1

A slice with a negative step walks a list backwards.

Hint 2

Join the numbers into text with spaces before printing.

Write your Python code, run it on the examples and submit it to hidden tests.