import Data.Sequence

main :: IO ()
main = do
  n <- readLn :: IO Int
  as <- (map read . words) <$> getLine :: IO [Int]
  let q = fromList []
  let q' = if odd n
          then (Prelude.reverse . toList []) $ loop q as n n
          else toList [] $ loop q as n n
  putStrLn $ unwords $ map show q'

toList l q =
  case viewl q of
    EmptyL -> Prelude.reverse l
    a :< q' -> toList (a:l) q'

loop q _ total 0 = q
loop q (a:as') total n =
  if (total - n + 1) `mod` 2 == 1
    then
      let q' = q |> a in loop q' as' total (n - 1)
    else
      let q' = a <| q in loop q' as' total (n - 1)
