#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e5 + 100;

int main () {
	int n, a[MAXN], b[MAXN];
	scanf ("%d", &n);
	for (int i = 1; i <= n; i ++)
		scanf ("%d", &a[i]);
	int m = n >> 1;
	for (int i = 1; i <= m; i ++) {
		b[i] = a[n - (i << 1) + 2];
		b[n - i + 1] = a[n - (i << 1) + 1];
	}
	if (n & 1)
		b[m + 1] = a[1];
	for (int i = 1; i < n; i ++)
		printf ("%d ", b[i]);
	printf ("%d\n", b[n]);
	return 0;
}