Huseyn arranged cards in a row with numbers a_1, a_2, a_3, ..., a_n. Then he collected them and rearranged them in a different order: a_1, a_3, a_5, ..., a_6, a_4, a_2. This is the sequence he gave to Yaroslav. Your task is to help Yaroslav restore Huseyn's original 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.
The first line contains one integer n~(1 \le n \le 10000), representing the number of cards. The second line contains positive integers written on the cards. All numbers are no greater than 10^9.
Print Huseyn's original sequence.
Example 1
Example 2