#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
 
int main()
{
	int n = 0;
	cin >> n;
	vector<int> a(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	vector<int> b(n);
	int index = 0;
	if (n % 2 == 1) {
		for (int i = n - 1; i >= 0; i -= 2) {
			b[index] = a[i];
			index++;
		}
		for (int i = 1; i <= n - 2; i+=2) {
			b[index] = a[i];
			index++;
		}
	}
	else {
		for (int i = n - 1; i >= 1; i-=2) {
			b[index] = a[i];
			index++;
		}
		for (int i = 0; i <= n - 2; i+=2) {
			b[index] = a[i];
			index++;
		}
	}
	for (int i = 0; i < n; i++) {
		cout << b[i] << " ";
	}
	cout << endl;
    return 0;
}