#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll n;
ll a[100010]; 
ll maxn,maxt,man;
int main()
{
	freopen("tahort.in","r",stdin);
	freopen("tahort.out","w",stdout);
	scanf("%lld",&n);
	for(ll i=1;i<=n;i++)
	{
		scanf("%lld",&a[i]);
	}
	for(ll i=1;i<=n;i++)
	{
		maxn=0;
		ll j=i;
		while(a[++j]>a[i])
		{
			if(a[j]>maxn)
			{
				maxn=a[j];
				maxt=j;
			}
		}
		man=max(man,maxt-i+1);
		//printf("i=%lld j=%lld maxt=%lld\n",i,j,maxt);
		i+=maxt-1;
		
	}
	printf("%lld",man);
	return 0;
}