#include<iostream>#include<cmath>#include<cstring>#include<cstdio>#include<algorithm>usingnamespacestd;
constint maxn=1e5+5;
int f[maxn],a[maxn];
int n,i,t,j,k,l,r,mid,num;
int main(){
//freopen("data.in","r",stdin);scanf("%d",&n);
for (i=1;i<=n;i++){
scanf("%d",&a[i]);a[i]-=i;
if (a[i]<0) continue;
if (a[f[num]]<=a[i] || !num) f[++num]=i;
else{
l=1;
r=num;
while (l<r){
mid=(l+r)/2;
if (a[f[mid]]<=a[i]) l=mid+1;
else r=mid;
}
f[l]=i;
}
}
t=n-num;
printf("%d\n",t);
}