import std.algorithm;
import std.array;
import std.container;
import std.conv;
import std.math;
import std.range;
import std.stdio;
import std.string;
import std.typecons;

T read(T)() { return readln.chomp.to!T; }
T[] reads(T)() { return readln.split.to!(T[]); }
alias readint = read!int;
alias readints = reads!int;

void main() {
    int n = readint;
    auto xs = readints;

    auto deque = DList!int();
    for (int i = 0; i < xs.length; i++) {
        if ((i & 1) == (n & 1)) {
            deque.insertBack(xs[i]);
        }
        else {
            deque.insertFront(xs[i]);
        }
    }

    writeln(deque[].map!(e => e.to!string).join(" "));
}
