Coaster Row Balance Swap

Before every launch, a coaster operator rebalances the single-file row of cars numbered 1 through n by swapping the riders in each adjacent pair of cars: the rider in car 1 swaps with the rider in car 2, the rider in car 3 swaps with the rider in car 4, and so on. If n is odd, the rider in the very last car has no partner and keeps their original seat. Given the rider ID currently sitting in each car, in car order, report the rider ID sitting in each car after this one round of pairwise swaps.

Input format

Line 1: an integer n, the number of cars. Line 2: n space-separated integers, the rider ID in car 1, 2, ..., n respectively.

Output format

A single line with n space-separated integers: the rider ID in each car, in car order, after the swap.

Constraints

• 1 <= n <= 100000
• Each rider ID is an integer between 1 and 1000000000, inclusive. IDs are not guaranteed distinct.

5
10 20 30 40 50

20 10 40 30 50

4
1 2 3 4

2 1 4 3