Taco - Maximum Strictly Increasing Subarray Length

Given an array of integers representing sweetness values and an integer n specifying the number of elements, determine the maximum length of a contiguous subarray that is strictly increasing. In other words, you need to find the longest subarray such that for every adjacent pair, the condition \(a_i < a_{i+1}\) holds.

For example, consider the array [1, 2, 2, 3, 4]. The longest strictly increasing subarray is [2, 3, 4] with a length of 3.

If n is 0, then the answer is 0.

inputFormat

The input is read from stdin and consists of two lines:

1. The first line contains an integer \(n\) \((0 \le n \le 10^5)\), representing the number of sweetness values.
2. The second line contains \(n\) space-separated integers representing the sweetness values.

outputFormat

Output a single integer to stdout representing the length of the longest strictly increasing contiguous subarray.

## sample

1
10

1

</p>