Maximum Increasing Temperature Sequence

You are given a sequence of daily temperatures. Your task is to find the length of the longest subsequence of consecutive days during which the temperature was strictly increasing.

Formally, let \(T = [t_1, t_2, \ldots, t_n]\) be the sequence of temperatures. You need to compute the value:

\[ \max_{1 \leq i \leq n} \{ k \;|\; t_i < t_{i+1} < \cdots < t_{i+k-1} \} \]

If the list is empty, output 0.

inputFormat

The input is given via standard input (stdin). The first line contains an integer \(N\) representing the number of days. The second line contains \(N\) space-separated integers representing the temperatures.

outputFormat

Output a single integer: the maximum number of consecutive days in which the temperature was strictly increasing.

## sample

1
5

1

</p>