Little Raju loves Arrays. One day when he was playing with arrays, his naughty friend Jaggu decided to trouble him and asked him a question on arrays. As it is a matter of pride for Little Raju, help him solve the question.

Let us define a good sub-array as a subarray such that

       1) subarray.length >= 3

       2) There exists i such that 0 < i < length - 1

        subarray[0] < subarray[1] < ... < subarray[i - 1] < subarray[i]

        subarray[i] > subarray[i + 1] > ... > subarray[subarray.length - 1]

Jaggu gives Raju an array and asks him to find out the longest good subaray in the given array.

Note :- longest here means maximum length

Input:

First line contains an integer N(0 ≤ N ≤ 2 * 10⁵) - Number of elements in the array

Second line elements a_i (0 ≤ a_i ≤ 10⁶) of the array A.

Output:

Output the length of longest good-subarray in the given array A