Codeforces Round #446 (Div. 2) B.Wrath

B. Wrath

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Hands that shed innocent blood!

There are n guilty people in a line, the i-th of them holds a claw with length Li. 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 - Li.

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 ≤ 106) — the number of guilty people.

Second line contains n space-separated integers L1, L2, ..., Ln (0 ≤ Li ≤ 109), where Li is the length of the i-th person's claw.

Output

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

Examples

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.

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
const int maxn=1e6+10;
int a[maxn];
int dead[maxn];
int main()
{
	int n;
	scanf("%d",&n); 
		for(int i=1;i<=n;i++)
		{
			scanf("%d",&a[i]);
		}
		reverse(a+1,a+1+n);
		memset(dead,0,sizeof(dead));
		int now=a[1]+1;
		for(int i=2;i<=n;i++)
		{
			if(i<=now) dead[i]=1;
			now=max(now,i+a[i]);
		}
		int ans=0;
		for(int i=1;i<=n;i++)
		{
			if(!dead[i]) ans++;
		}
		printf("%d\n",ans);
	return 0;
}