Alice left a secret sequence a[1..n] for her father Professor Seleznev. In order not to hide it, she decided to write it in the most visible place, but in a different order of numbers. Professor Seleznev knows that Alice rewrote the secret sequence as follows:
- the first number on the left is the number
a1;
- the first number on the right is the number
a2;
- the second number from the left (after
a1) is the number a3;
- the second number from the right (that is, before the number
a2) is the number a4;
- all other numbers are written in the same way.
That is, if the secret sequence was a = [1, 2, 3, 4, 5, 6], then the professor would see the following sequence [1, 3, 5 , 6, 4, 2]. Professor Seleznev was in a great hurry and only managed to save the sequence he saw into the computer. Write a program that will show the professor the original secret sequence.
Input
The first line contains the size of the sequence
n (1 <=
n <= 300) written by Alice for her father. The second line contains
n numbers
ai (1 <=
ai < ;= 10
9) - the sequence itself.
Imprint
Print the original sequence that Alice wrote out for her father.
Examples
| # |
Input |
Output |
| 1 |
6
1 3 5 6 4 2
|
1 2 3 4 5 6 |
| 2 |
1
23 |
23 |