//排队 #include <iostream> using namespace std; int a[30001],i,n,num,minx; int main() { cin>>n; for(i=1; i<=n; i++) { cin>>num; a[i]=a[i-1]+num-1; } minx=n; for(i=0; i<=n; i++) if(minx>a[i]+n-i-(a[n]-a[i])) minx=a[i]+n-i-(a[n]-a[i]); if(n==a[i]) minx=0; cout<<minx<<endl; return 0; }