import java.util.Scanner


object Main {
  def read() = {
    val sc = new Scanner(System.in)
    val n = sc.nextInt()
    val h = for (_ <- 0 until n) yield sc.nextInt()
    (n, h)
  }
  
  // O(n)解法(maxを先に求める)
  def solve5(n: Int, h: IndexedSeq[Int]): Int = {
    // maxHeightList(i) = max[ h(i) | i<- 0 to i]
    val maxHeightList = h.tail.scanLeft(h.head)(Math.max)
    //  #[k <- 0 until n | max[ h(i) | i<- 0 to k] <= h(k)]
    (h, maxHeightList).zipped.count { case (currentHeight, maxHeight) => currentHeight >= maxHeight }
  }


  def main(args: Array[String]): Unit = {
    val (n, h) = read()
    println(solve5(n, h))
  }

}