Longest Increasing Subarray

You are given an integer \( n \) representing the number of days and a sequence of \( n \) integers \( a_1, a_2, \ldots, a_n \) representing growth rates over consecutive days. Your task is to determine the length of the longest contiguous subarray where each element is strictly greater than the previous one.

For example, given the array \( [1, 2, 3, 2, 3, 4] \), the longest strictly increasing subarray is \( [1, 2, 3] \) with a length of 3.

inputFormat

The input consists of two lines:

1. The first line contains an integer \( n \) (\( 1 \leq n \leq 10^5 \)), the number of days.
2. The second line contains \( n \) space-separated integers \( a_1, a_2, \ldots, a_n \), representing the growth rates.

outputFormat

Output a single integer: the length of the longest strictly increasing contiguous subarray.

6
1 2 3 2 3 4

3