let n = read_int ()

let rec read_ints accu = function
  | 0 -> List.rev accu
  | k -> read_ints ((Scanf.scanf " %d" (fun x -> x)) :: accu) (k-1)

let a = Array.of_list (read_ints [] (2*n-1))

let check x =
  let rec aux = function
    | 0 -> a.(0) >= x
    | k -> if (a.(k-1) >= x) = (a.(k) >= x) then a.(k) >= x
           else if (a.(2*n-1-k) >= x) = (a.(2*n-2-k) >= x) then a.(2*n-2-k) >= x
           else aux (k-1) in
  aux (n-1)

let rec bsearch l r = if r = l+1 then l else let m = (l+r)/2 in if check m then bsearch m r else bsearch l m

let () = print_int (bsearch 1 (2*n))
