#include<bits/stdc++.h>
using namespace std;
deque<int>q;
int main()
{
	int n;cin>>n;
	for(int i=1,x;i<=n;i++)
	{
		cin>>x;
		if(i%2)q.push_front(x);
		else   q.push_back (x);
	}
	if(n%2==0) while(n--)cout<<q.back()<<" ",q.pop_back();
	else while(n--)cout<<q.front()<<" ",q.pop_front();
}

#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int a[N];
deque<int> dq;
int main()
{
    int n; cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        if (i % 2) dq.push_back(a[i]);
        else dq.push_front(a[i]);
    }
    if (n % 2) reverse(dq.begin(), dq.end());
    for (auto i = dq.begin(); i != dq.end(); i++) cout << *i << ' ';
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
deque<int>Q;
int main()
{
    int n;scanf("%d", &n);
    for(int i=1;i<=n;i++)
    {
        int x;scanf("%d", &x);
        if(i%2==1)Q.push_front(x);
        else Q.push_back(x);
    }
    if(n%2==1)
    {
        for(int i=1;i<=n;i++)
        {
            printf("%d ", Q.front());
            Q.pop_front();
        }
    }
    else
    {
        for(int i=1;i<=n;i++)
        {
            printf("%d ", Q.back());
            Q.pop_back();
        }
    }
    return 0;
}