eolymp
bolt
Try our new interface for solving problems
Problems

Cards game 2

Cards game 2

Time limit 1 second
Memory limit 128 MiB

Huseyn arranged n cards with numbers a_1, a_2, a_3, ..., a_n in a row. Then he collected them and arranged them in a different order: a_1, a_3, a_5, ..., a_6, a_4, a_2. He reported this sequence to Yaroslav. Help Yaroslav restore Huseyn's sequence.

For example, if Yaroslav received the sequence (2, 4, 9, 4, 7, 6), then he should return the sequence (2, 6, 4, 7, 9, 4) to Huseyn.

Input data

The first line contains the number n~(1 \le n \le 10000). The second line contains n positive integers written on the cards. All numbers are not greater than 10^9.

Output data

Print Huseyn's original sequence.

Examples

Input example #1
6
2 4 9 4 7 6
Output example #1
2 6 4 7 9 4
Input example #2
7
5 7 34 1 89 4 2
Output example #2
5 2 7 4 34 89 1 
Author Mykhailo Medvediev