# Time Complexity: O(n^2)
# TLE
n, A = int(raw_input()), []
for i in xrange(n):
    A.append(int(raw_input()))

res, cnt = [], 0
for i in xrange(len(A)):
    res.append(A[i])
    cur_cnt = 1
    for j in xrange(i+1, len(A)):
        if res[-1] < A[j]:
            res.append(A[j])
            cur_cnt += 1
            #print res
    cnt = max(cur_cnt, cnt)
    res = []

print cnt