#include<bits/stdc++.h>
using namespace std;
queue<int>q;
vector<int>c;
int main()
{
	int n;
	cin>>n;
	for(int i=0;i<n;i++)
	{
		int a;
		cin>>a;
		q.push(a);
	}
	int x=0;
	while(!q.empty())
	{
		x++;
		if(x%2==1)
		{
			cout<<q.front()<<" ";
			q.pop();
		}
		else if(x%2==0)
		{
			q.push(q.front());
			q.pop();
		}
	}
	return 0;
}