Bad Days

Description:

Input:

The first line contains an integer $$$n$$$ ($$$1 \le n \le 2\cdot10^5$$$), where $$$n$$$ is the number of days. The second line contains $$$n$$$ positive integers $$$a_1, a_2, \dots, a_n$$$ ($$$1 \le a_i \le 10^9$$$), where $$$a_i$$$ is the number of website visits on the $$$i$$$-th day.

Output:

Print the number of bad days, i.e. such days that there are at least two days before it with a strictly greater number of visits.

Sample Input:

8
3 1 4 1 5 9 2 6

Sample Output:

2

Sample Input:

5
1 1 1 1 1

Sample Output:

0

Sample Input:

13
2 7 1 8 2 8 1 8 2 8 4 5 9

Sample Output:

6