// tested by Hightail - https://github.com/dj3500/hightail
import std.stdio, std.string, std.conv, std.algorithm;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;

int n;
int[] a;

void main() {
    scan(n);
    a = readln.split.to!(int[]);

    auto b = DList!int();

    foreach (i ; 0 .. n) {
        if (i & 1) {
            b.insertBack(a[i]);
        }
        else {
            b.insertFront(a[i]);
        }
    }

    if (n & 1) {
        foreach (i ; 0 .. n) {
            writef("%d%c", b.front, i < n - 1 ? ' ' : '\n');
            b.removeFront();
        }
    }
    else {
        foreach (i ; 0 .. n) {
            writef("%d%c", b.back, i < n - 1 ? ' ' : '\n');
            b.removeBack();
        }
    }
}


void scan(T...)(ref T args) {
    string[] line = readln.split;
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}


void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}