Codeforces Round #395 (Div. 2)Timofey and cubes

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <queue>
#include <vector>
#include <map>
#include <cmath>
#include <stdlib.h>
using namespace std;
const double PI = acos(-1.0);
const double eps = 0.1;
const int MAX = 2e5+10;
const int mod = 1e9+7;
long long n, a[MAX], k;

int main()
{
    cin>>n;
    for(int i = 1; i<=n; ++i)
        cin>>a[i];
    for(int i = 1; i<=n/2; ++i)
        if(i%2)swap(a[i], a[n-i+1]);
    for(int i = 1; i<=n; ++i)
        cout<<a[i]<<((i==n)?'\n':' ');
    return 0;
}