#include<cstdio>
#include<algorithm>
#define mx 1000010
using namespace std;
int n,a[mx],sol[mx],dd,i,j,mins;
int main(){
	freopen("subs.in", "r", stdin);
	freopen("subs.out", "w", stdout);
	scanf("%ld", &n);
	scanf("%d", &a[1]);
	for(i=2;i<=n;++i){
		scanf("%d", &a[i]);
	}
	for(i=n;i>=1;--i){
		dd=1;
		for(j=i;j<=n;++j){
			if(a[j]<a[j+1]){
				dd++;
			}
		}
		sol[i]=dd;
	}
	sort(sol+1,sol+n+1);
	printf("%d", sol[n]);
	return 0;
}