let () =
  let rec insert lst (i,n) = match lst with
    | [] -> [(i, n)]
    | (j,m) :: t -> if i = j then (j, n+m) :: t else (j,m) :: insert t (i,n) in
  Scanf.scanf "%d\n" @@ fun n ->
  let arr  = Array.to_list (Array.init n @@ fun _ -> Scanf.scanf "%d " @@ fun d -> d) in
  let brr  = Array.to_list (Array.init n @@ fun _ -> Scanf.scanf "%d " @@ fun d -> d) in
  let rank = List.fold_left2 (fun lst b a -> insert lst (b,a)) [] brr arr in
  let slst = List.fast_sort (fun (ix,nx) (iy,ny) -> ny-nx) rank in
  let (ans,_) = List.fold_left
      (fun (b,buf) (i,x) -> if buf = x && i = 0 then (b || true, buf) else (b || false, buf))
      ((if fst (List.hd slst) = 0 then true else false), snd (List.hd slst)) (List.tl slst) in
  Printf.printf "%s\n" (if ans then "YES" else "NO")