Codeforces 892 B. Wrath （递推）div2

Hands that shed innocent blood!

There are n guilty people in a line, the i-th of them holds a claw with length L_i. The bell rings and every person kills some of people in front of him. All people kill others at the same time. Namely, the i-th person kills the j-th person if and only if j < i and j ≥ i - L_i.

You are given lengths of the claws. You need to find the total number of alive people after the bell rings.

Input

The first line contains one integer n (1 ≤ n ≤ 10⁶) — the number of guilty people.

Second line contains n space-separated integers L₁, L₂, ..., L_n (0 ≤ L_i ≤ 10⁹), where L_i is the length of the i-th person's claw.

Output

Print one integer — the total number of alive people after the bell rings.

Example

Input

4
0 1 0 10

Output

1

Input

2
0 0

Output

2

Input

10
1 1 3 0 0 0 2 1 0 3

Output

3

Note

In first sample the last person kills everyone in front of him.

   题意是每个人都有长度为Li的爪子，来杀掉前面的人，每个人之间距离为1，在一个时间同时杀，问最后存活了几人？

刚开始原本以为理解了题意，然而并没有。。然后就在TLE和WA间。。。

#include<bits/stdc++.h>
using namespace std;
int main() {
	int n,a[100000];
	while(~scanf("%d",&n)) {
		for(int i=0; i<n; i++) {
			scanf("%d",&a[i]);
		}
		int ans=1;
		for(int i=n-1; i>=0; i--) {
			int len=i-a[i];//确定最远死者的位置
			for(int j=i-1; j>=len&&j>=0; j--) {
				len=min(j-a[j],len);更新更远的死者
				i=len;
				ans++;
			}
		}
		printf("%d\n",n-ans);
	}
}