Longest Increasing Subarray

You are given an array of integers. Your task is to find the length of the longest contiguous subarray such that the subarray forms a strictly increasing sequence. Formally, for a subarray with indices from i to j (where 0 ≤ i ≤ j < n), the condition that must be satisfied is:

$$a_{k} < a_{k+1} \quad \text{for all } i \le k < j.$$

If the array is empty, the output should be 0.

inputFormat

The first line contains an integer n (n ≥ 0) which denotes the number of elements in the array. The second line contains n space-separated integers representing the elements of the array.

outputFormat

Output a single integer representing the length of the longest contiguous subarray that forms a strictly increasing sequence.

7
1 2 3 2 3 4 5

4