#include <bits/stdc++.h>
using namespace std;
int prime[1000001];
int main() {
  int i, n;
  scanf("%d", &n);
  long long a[n + 1];
  for (i = 1; i <= n; i++) scanf("%lld", &a[i]);
  long long t;
  int nn = n >> 1;
  for (i = 1; i <= nn; i += 2) {
    swap(a[i], a[n - i + 1]);
  }
  for (i = 1; i < n; i++) printf("%lld ", a[i]);
  printf("%lld\n", a[n]);
}
