Longest Increasing Temperature Sequence

You are given a sequence of temperature readings for consecutive days. Your task is to determine the length of the longest contiguous subsequence where the temperatures are strictly increasing.

Formally, given an array \(T = [T_1, T_2, \dots, T_n]\), find the maximum \(L\) such that for some index \(i\) with \(1 \le i \le n - L + 1\), we have \[ T_i < T_{i+1} < \cdots < T_{i+L-1}, \] where \(L \ge 1\).

The input is read from standard input (stdin) and the result should be printed to standard output (stdout).

inputFormat

The first line contains an integer \(n\) indicating the number of days. The second line contains \(n\) space-separated integers representing the temperatures for each day.

\(1 \le n \le 10^5\) and each temperature is an integer.

outputFormat

Output a single integer representing the length of the longest contiguous subsequence of days with strictly increasing temperatures.

## sample

8
30 32 33 28 35 36 37 32

4

</p>