CodeForces - 892B Wrath（每一个人有一把长度为a[i]的武器，这个人能把左边距离为他为a[i]的能人全杀完，看看最终会留下多少人）

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

题意：每一个人有一把长度为a[i]的武器，这个人能把左边距离为他为小于等于a[i]的能人全杀完，看看最终会留下多少人

题解：首先你要看n的范围，10的6次方，一百万，所以一层循环，两层循环可能会超时；

从后往前推，这样就不会拉下，定义一个d[]数组;

代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define Max 1000010
#define INF 0x3f3f3f3f

int a[Max];
int d[Max],n; // 从后往前推，d[i] 表示 从后面到当前位置的人 能杀到的最小编号； 
void init()
{
	int i;
	for(i = 0;i <= n;i++ )
		d[i] = INF;
}
int main()
{
	int i,j;

	while(~scanf("%d",&n))
	{
		for(i=1;i<=n;i++)
			scanf("%d",&a[i]);
		init();
		int sum = 1;
		d[n] = n - a[n];
		for(i=n-1;i>=1;i--)
		{
			d[i] = min(d[i+1],i-a[i]);
			if(i<d[i+1])
				sum++;
		}
		printf("%d\n",sum);
	}
	return 0;
}