Swap the neighbours#7848

Swap the neighbours

1 second
128 megabytes
Very easy

Given array of integers. Swap the neighbouring elements of array (a_0 with a_1, a_2 with a_3 and so on). If there are odd number of elements, leave the last element in its place.

Input

First line contains number . Next line contains integers. All numbers do not exceed by absolute value.

Output

Print the updated array.

Examples

Example 1

Loading
Loading