#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void c_p_c() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
int gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(a % b, b);
}
bool is_pallindrome(string str, int left, int right) {
  if (left > right) return true;
  return (str[left] == str[right] && is_pallindrome(str, left + 1, right - 1));
}
int32_t main() {
  c_p_c();
  int n, k = 1;
  cin >> n;
  int arr[n];
  int left = 0, right = n - 1;
  for (int i = 0; i < n; i++) cin >> arr[i];
  for (int i = 0; i <= n - i - 1; i++) {
    if ((i % 2) - 1) {
      swap(arr[i], arr[n - i - 1]);
    }
  }
  for (int i = 0; i < n; i++) cout << arr[i] << ' ';
  cout << '\n';
  return 0;
}
