B'You are given an array a consisting of n integers. You can remove at most one element from this array. Thus, the final length of the array is n-1 or n . Your task is to calculate the maximum possible length of the strictly increasing contiguous subarray of the remaining array. Recall that the contiguous subarray a with indices from l to r is a[l ... r] = a_l, a_{l + 1}, ... , a_r . The subarray a[l ... r] is called strictly increasing if a_l < a_{l+1} < ... < a_r . The first line of the input contains one integer n ( 2 <= n <= 2 cdot 10^5 ) -- the number of elements in a . The second line of the input contains n integers a_1, a_2, ... , a_n ( 1 <= a_i <= 10^9 ), where a_i is the i -th element of a . Print one integer -- the maximum possible length of the strictly increasing contiguous subarray of the array a after removing at most one element. In the first example, you can delete a_3=5 . Then the resulting array will be equal to [1, 2, 3, 4] and the length of its largest increasing subarray will be equal to 4 . '...