qwq

#include <iostream>
using namespace std;
const int Maxn=10010;
int a[Maxn];
int main()
{
	int n;cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
	}
	//初始化+in
	int pos=2,ans=0;
	while(pos<=n)
	{
		if(a[pos]<a[pos-1])
		{
			while(a[pos]<a[pos-1]&&pos<=n+1)
			{
//				cout<<pos<<' '<<a[pos-1]<<' '<<a[pos]<<endl;//
				pos++;
			}
			ans++;
		}
		pos++;
	}
	if(pos>n) ans--;
	//计算低硅池
	cout<<ans<<endl;
	//out 
	return 0;
} 
/*
in:
10
0 1 0 2 1 2 0 0 2 0
out:
3
*/