Ivan recently bought a detective book. The book is so interesting that each page of this book introduces some sort of a mystery, which will be explained later. The i-th page contains some mystery that will be explained on page ai (ai≥i).
Ivan wants to read the whole book. Each day, he reads the first page he didn’t read earlier, and continues to read the following pages one by one, until all the mysteries he read about are explained and clear to him (Ivan stops if there does not exist any page i such that Ivan already has read it, but hasn’t read page ai). After that, he closes the book and continues to read it on the following day from the next page.
How many days will it take to read the whole book?
Input
The first line contains single integer n (1≤n≤104) — the number of pages in the book.
The second line contains n integers a1,a2,…,an (i≤ai≤n), where ai is the number of page which contains the explanation of the mystery on page i.
Output
Print one integer — the number of days it will take to read the whole book.
Example input
9
1 3 3 6 7 6 8 8 9
output
4
Note
Explanation of the example test:
During the first day Ivan will read only the first page. During the second day Ivan will read pages number 2 and 3. During the third day — pages 4-8. During the fourth (and the last) day Ivan will read remaining page number 9.
解题思路
从后往前找前面最大的数和坐标下坠的相同的一共有几个（自闭）
代码样例
#include<iostream>
#include<algorithm>
using namespace std;
int a[1000005];
int main()
{
int n;
cin >> n;
for(int i=1; i <= n; i++)
scanf("%d",&a[i]);
int ans=0,max_=0;
for(int i=1; i <= n; i++)
{
if(max_ < a[i])
max_=a[i];
if(max_ == i)
ans++;
}
cout << ans << endl;
return 0;
}