#include <bits/stdc++.h>
using namespace std;
const int N = 1000 * 100 * 3 + 20;
const int MAX_X = 1000 + 20;
const int MAX_N = 100 + 20;
const int MOD = 1000 * 1000 * 1000 + 7;
const int INF = 1000 * 1000 * 1000;
long long poww(long long x, long long y) {
  return (!y ? 1 : (y & 1 ? x * poww(x * x, y / 2) : poww(x * x, y / 2)));
}
int a[N];
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < n / 2; i += 2) swap(a[i], a[n - i - 1]);
  for (int i = 0; i < n; i++) cout << a[i] << ' ';
  return 0;
}
