#include <bits/stdc++.h>
using namespace std;
const int maxn = 200010;
int A[maxn], N;
int main() {
  cin >> N;
  for (int i = 1; i <= N; ++i) scanf("%d", A + i);
  for (int i = 1; i <= N - i + 1; ++i)
    if (i & 1) swap(A[i], A[N - i + 1]);
  for (int i = 1; i <= N; ++i) printf("%d ", A[i]);
  return 0;
}
