Swap the first and last bus stop

Problem

A bus route is stored as an array of stop numbers. For the return trip the conductor wants the first and last stops exchanged, and everything else left as it is. Swap them and print the route.

Input, output and limits

Input: The first line has n. The second line has n integers: the stop numbers.
Output: One line: the route after the swap, separated by spaces.
Constraints: 1 ≤ n ≤ 1000
1 ≤ stop number ≤ 10^6

Examples

Example

Input

5
101 205 310 412 520

Output

520 205 310 412 101

Only 101 and 520 change places.

Hints

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

Hint 1

The last element is at index n - 1, not n.

Hint 2

Swap with a temporary variable: save one value, overwrite it, then put the saved value in the other place.

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

Solve in the editor

Reverse a playlist in placeeasy
Swap neighbours in pairseasy
Credits, debits and zero entrieseasy
Mirror array checkeasy
Find a token: first, last and counteasy

All Java problems

Problem

Input, output and limits

Examples

Hints

More Arrays problems

Problem

Input, output and limits

Examples

Hints

More Arrays problems