#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int N = 1000100;
int maxl=0, snum=0;
int mnum[N];
int main()
{
	int high=0;
	memset(mnum, 0, sizeof(mnum));
	while (~scanf("%d", &high))
	{
		if (maxl<high )
		{
			snum += 1;
			maxl = high;
			mnum[snum] += 1;
		}
		if(maxl>high)
		{
			mnum[snum] += 1;
			maxl = high;
		}
	}
	sort(mnum, mnum + snum);
	cout << snum << mnum[snum];

	return 0;
}