import Data.List

cent :: Int -> [Int] -> Int
cent n l   = head $ drop (n`div`2) l

makelistsub :: Int -> [Int] -> [Int]
makelistsub 1 l = [head l]
makelistsub n l = (makelistsub (n-1) l) ++ [cent n $ take n l]

makelist :: Int -> [Int] ->[Int]
makelist _ [] = []
makelist n l  = (makelistsub n l) ++ (makelist (n-1) $ tail l)

main :: IO()
main = do
  n' <- getLine
  l' <- getLine
  let n = read n'
      l = map read $ words l'
  putStrLn $ show $ cent ((n*(n+1))`div`2) $ sort $ makelist n l
