Problem:
Score : 300 points

Problem Statement

You are given an integer sequence of length n, a_1, ..., a_n.
Let us consider performing the following n operations on an empty sequence b.

The i-th operation is as follows:

Append a_i to the end of b.

Reverse the order of the elements in b.

Find the sequence b obtained after these n operations.

Constraints

1 \leq n \leq 2\times 10^5

0 \leq a_i \leq 10^9

n and a_i are integers.

Input

Input is given from Standard Input in the following format:

n
a_1 a_2 ... a_n

Output

Print n integers in a line with spaces in between.
The i-th integer should be b_i.

Sample Input 1

4
1 2 3 4

Sample Output 1

4 2 1 3

After step 1 of the first operation, b becomes: 1.

After step 2 of the first operation, b becomes: 1.

After step 1 of the second operation, b becomes: 1, 2.

After step 2 of the second operation, b becomes: 2, 1.

After step 1 of the third operation, b becomes: 2, 1, 3.

After step 2 of the third operation, b becomes: 3, 1, 2.

After step 1 of the fourth operation, b becomes: 3, 1, 2, 4.

After step 2 of the fourth operation, b becomes: 4, 2, 1, 3.

Thus, the answer is 4 2 1 3.

Sample Input 2

3
1 2 3

Sample Output 2

3 1 2

As shown above in Sample Output 1, b becomes 3, 1, 2 after step 2 of the third operation. Thus, the answer is 3 1 2.

Sample Input 3

1
1000000000

Sample Output 3

1000000000

Sample Input 4

6
0 6 7 6 7 0

Sample Output 4

0 6 6 0 7 7

Solution in C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {

/** 
    3
    1 2 3
    3 1 2

    1
    1000000000
    1000000000

    4
    1 2 3 4
    4 2 1 3

    6
    0 6 7 6 7 0
    0 6 6 0 7 7

    1
    0 

    2 1 
    6 0

    3 1 2
    7 0 6
    
    4 2 1 3
    6 6 0 7
     
    5 3 1 2 4
    7 7 0 6 6

    6 4 2 1 3 5   
    0 6 6 0 7 7


 */

    int n;
    cin >> n;

    int nums[n];
    for (int i = 0; i < n; i++) cin >> nums[i];

    vector<int> odds, evens;

    for (int i = 0; i < n; i++){
        if (i % 2 == 0){
            odds.push_back(nums[i]);
        } else {
            evens.push_back(nums[i]);
        }
    }

    if (n % 2 == 0){
        while (!evens.empty()){
            int t = evens.back();
            evens.pop_back();
            cout << t << " ";
        }

        while (!odds.empty()){
            int t = odds.front();
            odds.erase(odds.begin());
            cout << t << " ";
        }
    } else {
        vector<int> ts;

        while (!evens.empty()){
            int t = evens.back();
            evens.pop_back();
            ts.push_back(t);
        }

        while (!odds.empty()){
            int t = odds.front();
            odds.erase(odds.begin());
            ts.push_back(t);
        }

        reverse(ts.begin(), ts.end());

        for(int i = 0; i < ts.size(); i++) cout << ts[i] << " ";
    }


    // example 3 doesn't work
    
}