A row of n towers is given left to right, each with a positive integer height. The sun sets far to the east (past the right end of the row). A tower can see the sunset if and only if it is strictly taller than every tower to its right (a tower with nothing to its right always can).
Count how many towers can see the sunset.
Input format
Line 1: an integer n.
Line 2: n space-separated integers, the tower heights from left (west) to right (east).
Output format
A single integer: the number of towers that can see the sunset.
Constraints
- 1 <= n <= 100000
- 1 <= height <= 1000000000