#include<bits/stdc++.h> using namespace std; int n,a[1000005]; deque<int>q; int main(){ cin>>n; for(int i=1;i<=n;i++)cin>>a[i]; for(int i=1,flg=n%2;i<=n;i++,flg^=1){ if(flg)q.push_front(a[i]); else q.push_back(a[i]); } while(q.size()){ cout<<q.front()<<" ";; q.pop_front(); } return 0; }