#include<iostream>
using namespace std;
int a[101],b[101];
int main()
{
	int n;
	cin >> n;
	int sum = 0,k=0;
	for (int i = 0; i < n; i++)
	{
		cin >> a[i];
	}
	int j = 0, flag = 0, flag1 = 0;
	for (int i = 1; i < n; i++)
	{
		if (a[i] < a[i + 1] && a[i] < a[i - 1])
		{
			flag1 = 1;//用flag1使第一个if和第三个if不重复sum++
			sum++;
		}
		if (a[i] == a[i + 1]&&flag==0)//用flag来使b[j]停留在第一次a[i]=a[i-1]
		{
			b[j]= i;
			flag = 1;
		}
		if (a[i] < a[i + 1] && a[b[j]] < a[b[j] - 1]&&flag1==0)
		{
			flag = 0;
			j++;//从平往上时再对数组b下标更新
			sum++;
		}
	}
	cout << sum;
	return 0;
	system("pause");
}