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

auto rdsp(){return readln.splitter;}
void pick(R,T)(ref R r,ref T t){t=r.front.to!T;r.popFront;}
void readV(T...)(ref T t){auto r=rdsp;foreach(ref v;t)pick(r,v);}
void readA(T)(size_t n,ref T[]t){t=new T[](n);auto r=rdsp;foreach(ref v;t)pick(r,v);}
void writeA(T)(size_t n,T t){foreach(i,v;t.enumerate){write(v);if(i<n-1)write(" ");}writeln;}

void main()
{
  int n; readV(n);
  int[] a; readA(n, a);

  auto b = new int[](n);
  if (n%2 == 0) {
    foreach (i; 0..n/2)
      b[i] = a[n-i*2-1];
    foreach (i; 0..n/2)
      b[i+n/2] = a[i*2];
  } else {
    foreach (i; 0..n/2+1)
      b[i] = a[n-i*2-1];
    foreach (i; 0..n/2)
      b[i+n/2+1] = a[i*2+1];
  }

  writeA(n, b);
}
