Problem Statement

Honey Bees Problem Description Rahul has purchased N honey bee queens and unintentionally placed them all in the same box. Each honey bee queen possesses a certain power level. A queen at the ith index can eliminate other queens located at indices j, where 0 ≤ j < i, provided that those queens have lower power levels than the ith queen. You are given the power level of each honey bee queen. Your task is to determine and print the total number of queens that remain alive after the fights. Input Format The first line contains an integer N, representing the number of honey bee queens. The second line contains N integers separated by spaces, representing the power levels of each honey bee queen. Output Format The output will be a single integer representing the total number of honey bee queens that remain alive after the fights. Constraints