#include<iostream>
#include<cmath>
using namespace std;
long long h[100005];
int n;
long long top[100005];
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;++i) 	
		scanf("%lld",&h[i]),top[i]=max(top[i-1],h[i]);
	long long ans=0,maxn=h[1],tail=1;
	for(int i=2;i<=n;++i)
	{
		if(h[i]<=h[tail])
		{
			tail=i;
			maxn=h[i];
		}
		else
		{
			if(h[i]>maxn)
			{
				ans=max(ans,i-tail+1);
				maxn=h[i];
				if(h[i]==top[n])
				{
					tail=i+1;
					maxn=h[i+1];
					i+=1;
				}
			}
		}
	}
	printf("%lld",ans);
	return 0;
}