Longest Increasing Subarray

Given an array of integers, your task is to compute the length of the longest contiguous subarray in which the elements are strictly increasing. In other words, find the maximum length \(k\) such that there exists an index \(i\) where \(a_{i} < a_{i+1} < \cdots < a_{i+k-1}\). If the array is empty, the answer is 0.

inputFormat

The input is given as a single line on standard input, containing a sequence of integers separated by spaces representing the array elements. An empty line represents an empty array.

outputFormat

Output the length of the longest contiguous subarray with strictly increasing elements on standard output.

1 2 1 2 3 4 1

4