Longest Increasing Contiguous Temperature Sequence

You are given a sequence of temperature readings. Your task is to determine the length of the longest contiguous segment in which the temperatures are strictly increasing. In other words, if the temperature readings are (T_1, T_2, \ldots, T_n), you must find the maximum length of a segment (T_i, T_{i+1}, \ldots, T_j) such that for every index (k) with (i \le k < j), the condition (T_k < T_{k+1}) holds.

inputFormat

The input is read from standard input (stdin). The first line contains a single integer (n) representing the number of temperature readings. The second line contains (n) space-separated integers representing the temperature readings.

outputFormat

Output to standard output (stdout) a single integer representing the length of the longest contiguous segment of strictly increasing temperatures.## sample

10
1 2 3 2 3 4 1 2 3 4

4