import qualified Data.Vector as V
import qualified Data.Vector.Mutable as VM
import Data.ByteString.Char8 as B
import Data.Maybe
import Data.Char
import Data.List
import Control.Monad
import Control.Monad.ST

solve vec n 
    | even n = do
        xs <- forM (Data.List.reverse [1,3..n-1]) $ \i -> VM.read vec i >>= return
        ys <- forM [0,2..n-2] $ \i -> VM.read vec i >>= return
        return $ (V.fromList xs) V.++ (V.fromList ys)
    | otherwise = do
        xs <- forM [1,3..n-2] $ \i -> VM.read vec i >>= return
        ys <- forM (Data.List.reverse [0,2..n-1]) $ \i -> VM.read vec i >>= return
        return $ (V.fromList ys) V.++ (V.fromList xs)


conv :: Maybe (Int, B.ByteString) -> Maybe (String, B.ByteString)
conv v = case v of
    Just (a, b) -> Just (show a, b)
    Nothing -> Nothing 

main = do
    n <- readLn :: IO Int
    xs <- V.unfoldrN n (conv . B.readInt . B.dropWhile isSpace) <$> B.getLine
    xs' <- V.unsafeThaw xs
    res <- solve xs' n
    Prelude.putStrLn $ Data.List.tail $ (V.foldl' (\s r -> s ++ " " ++ r) "" res)
    