Problem Statement

Honey Bees Problem Description A beekeeper accidentally placed N honey bee queens together in the same box. Each queen has a certain power level, and a queen standing at index i can defeat any other queen sitting at an index j with 0 ≤ j < i, as long as that queen's power level is lower than the one at index i. Given the power level of every queen, work out how many queens are still alive once all the fighting that can happen has happened. 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