#include <bits/stdc++.h>
using namespace std;
namespace {
int CC_;
const double EPS = 1E-9;
const double PI = 2 * acos(0.0);
const long long MOD = 1000000007;
template <class T>
void DA(T i, T e) {
  while (i != e) {
    cout << "Con>>( " << ++CC_ << " ) " << *i++ << "\n";
  }
}
template <class T>
void DA(T* x, int l) {
  for (int i = 0; i < l; i++) cout << "[" << i << "]>> " << x[i] << "\n";
}
template <class T>
inline void sary(T* st, T* nd) {
  while (st < nd) cin >> *st++;
}
template <class T>
void tobin(T n, char* bin) {
  int pos = 1 << ((int)log2(n));
  while (pos >= 1) {
    if ((n & pos) == 0)
      *bin = '0';
    else
      *bin = '1';
    pos >>= 1;
    bin++;
  }
  *bin = '\0';
}
template <class T>
int strOccur(string& s, T& tgt) {
  int oc = 0, p = s.find(tgt);
  while (p != string::npos) {
    p = s.find(tgt, p + 1);
    oc++;
  }
  return oc;
}
template <class T>
inline T LCM(T x, T y) {
  return ((x * y) / __gcd(x, y));
}
long long todec(string& num, int b) {
  long long dec = num[0] - (isupper(num[0]) ? 'A' - 10 : '0');
  for (int i = 1; num[i]; i++) {
    if (num[i] >= 'A' && num[i] <= 'Z')
      num[i] -= 'A' - 10;
    else
      num[i] -= '0';
    dec *= b;
    dec += num[i];
  }
  return dec;
}
int bigMod(int b, int e, int m) {
  if (e == 0) return 1;
  if (!(e & 1)) {
    int temp = bigMod(b, e / 2, m) % m;
    return (temp * temp) % m;
  } else
    return ((b % m) * (bigMod(b, e - 1, m)) % m) % m;
}
bool comp(const int a, const int b) { return a > b; }
}  // namespace
const int sss = 1E6;
int a[200019];
void solve(void) {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  int lim = n / 2;
  for (int i = 0, j = n - 1; i < lim; i++, j--) {
    if (i % 2 == 0) {
      swap(a[i], a[j]);
    }
  }
  for (int i = 0; i < n; i++) {
    cout << a[i] << " ";
  }
  cout << "\n";
  ;
}
int main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
  return 0;
}
