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)

//In th name of ALLAH\\

// m    m  mmmm  mmmmm          mmmm   mmmm
// #    # m"  "m   #           "   "# m"  "m
// #mmmm# #    #   #             mmm" #    #
// #    # #    #   #     """       "# #    #
// #    #  #mm#  mm#mm         "mmm#"  #mm#

#include <bits/stdc++.h>
#define cn const int
#define ll long long
#define pq priority_queue
#define enter cout << endl
#define pb push_back
#define ff first
#define ss second
#define pii pair <int, int>
#define vi vector <int>
#define msi map <string, int>
#define Qi queue <int>
#define dQi deque <int>
#define str string
#define int ll
#define FOR(v, i, j) for (int v = i; v < j; v ++)
#define ROF(v, i, j) for (int v = i; v > j; v --)
using namespace std;

//START hh : mm \\// ET mm + mm
//	       END hh : mm

cn mod = 1e9 + 7;
cn inf = 2e9 + 9e2;
const ll linf = 2e18 + 18e2;
cn MAXN = 2e5 + 5e2;

int a[MAXN];

void f(int n) {
    if (n == 0) {cout << a[0] << ' '; return;}
    if (n < 0) return;
    cout << a[n] << ' ';
    f(n-2);
    cout << a[n-1] << ' ';
}

main() {
    ios_base::sync_with_stdio(false);
    int n;
    cin >> n;
    for (int i =0 ;i < n;i ++)
        cin >> a[i];
    f(n - 1);
    return 0;
}

//Sea do not have any space for unmanned ships
//This region of city is safe, i have been tried to stay alive
//I used to be good till this city makes me bad with its drought

// m    m mmmmmm m      m      mmmmm         mmmmm     mm
// #    # #      #      #        #           #        m"#
// #mmmm# #mmmmm #      #        #           """"mm  #" #
// #    # #      #      #        #     """        # #mmm#m
// #    # #mmmmm #mmmmm #mmmmm mm#mm         "mmm#"     #
//	        	   H-54703802904130102