Longest Increasing Contiguous Subsequence

Given a sequence of integers, find the length \( L \) of the longest contiguous subsequence where each element is strictly greater than the previous one. Formally, for a sequence \( a_1, a_2, \dots, a_n \), determine the maximum integer \( L \) such that there exists an index \( i \) with \( a_i < a_{i+1} < \dots < a_{i+L-1} \).

The input begins with an integer \( n \) representing the number of elements, followed by \( n \) space-separated integers.

inputFormat

The first line of the input contains an integer \( n \) (the number of elements). The second line contains \( n \) space-separated integers representing the sequence.

outputFormat

Output a single integer, the length of the longest contiguous subsequence where the numbers are strictly increasing.

6
1 3 2 2 5 7

3