I found an interesting problem on https://codeforces.com/problemset/problem/702/A:
You are given array consisting of n integers. Your task is to find the maximum length of an increasing subarray of the given array.

A subarray is the sequence of consecutive elements of the array. Subarray is called increasing if each element of this subarray strictly greater than previous.


-----Input-----

The first line contains single positive integer n (1 ≤ n ≤ 10^5) — the number of integers.

The second line contains n positive integers a_1, a_2, ..., a_{n} (1 ≤ a_{i} ≤ 10^9).


-----Output-----

Print the maximum length of an increasing subarray of the given array.


-----Examples-----
Input
5
1 7 2 11 15

Output
3

Input
6
100 100 100 100 100 100

Output
1

Input
3
1 2 3

Output
3

I tried it in Python, but could not do it. Can you solve it?
n=int(input())
l=input().split()
best=1
curr=1
for i in range (n-1):
    if int(l[i])<int(l[i+1]):
        curr+=1
    else:
        curr=1
    best=max(best,curr)
print (best)