CF702A.Maximum Increase

You are given array consisting of n integers. Your task is to find the maximum length of an increasing subarray of the given array.

A subarray is the sequence of consecutive elements of the array. Subarray is called increasing if each element of this subarray strictly greater than previous.

给你一个由 $n$ 个整数组成的数组。你的任务是找出该数组中最长递增子数组的长度。

子数组是指数组中连续的一段元素序列。若子数组中每个元素都严格大于其前一个元素，则称该子数组为递增子数组。

The first line contains single positive integer n (1 ≤ n ≤ 105) — the number of integers.

The second line contains n positive integers _a_1, _a_2, ..., a__n (1 ≤ a__i ≤ 109).

第一行包含一个正整数 $n$（$1 \leq n \leq 10^5$）—— 表示整数的个数。

第二行包含 $n$ 个正整数 $a_1, a_2, ..., a_n$（$1 \leq a_i \leq 10^9$）。

Print the maximum length of an increasing subarray of the given array.

输出给定数组的最长递增子数组的长度。