Mountain Trek

A hiker records the altitude every minute during a trek. A climbing streak is a contiguous segment of the recording where every altitude is strictly higher than the previous one. Find the length of the longest climbing streak.

Input

The first line contains one integer n — the number of recorded altitudes.

The second line contains n integers a₁ … aₙ — the altitudes in order.

Output

Print the maximum climbing streak length.

Constraints

• 1 ≤ n ≤ 2·10⁴
• −10⁷ ≤ aᵢ ≤ 10⁷
• A single measurement counts as a streak of length 1.

8
2 4 5 1 2 3 7 0

4

4
9 9 9 9

1