(* O(n) *)
let solve n hs =
  List.fold_left
    (fun ((sofar_max, count) as sofar) h ->
      if sofar_max <= h then (h, count + 1) else sofar)
    (0, 0)
    hs |> snd

let read_ints () = read_line () |> Str.split (Str.regexp " ") |> List.map int_of_string

let _ =
  let n = read_int () in
  let hs = read_ints () in
  solve n hs |> string_of_int |> print_endline