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.

Input

The first line of the input contains one integer n (2 ≤ n ≤ 2 ⋅ 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.

Output

Print one integer — the maximum possible length of the strictly increasing contiguous subarray of the array a after removing at most one element.

Examples

Input


5
1 2 5 3 4


Output


4


Input


2
1 2


Output


2


Input


7
6 5 4 3 2 4 3


Output


2

Note

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.
from collections import defaultdict as dc
'''from collections import deque as dq
from bisect import bisect_left,bisect_right,insort_left'''
import sys
import math
#define of c++ as inl=input()
mod=10**9 +7
'''def bs(a,x):
    i=bisect_left(a,x)
    if i!=len(a):
        return i
    else:
        return len(a)
def bs(a,b):
    l=a
    r=b+1
    x=b
    ans=0
    while(l<r):
        mid=(l+r)//2
        if x|mid>ans:
            ans=x|mid
            l=mid+1
        else:
            r=mid
    return ans
def digit(n):
    a=[]
    while(n>0):
        a.append(n%10)
        n=n//10
    return a'''
def inp():
    p=int(input())
    return p
def line():
    p=list(map(int,input().split()))
    return p
n=inp()
a=line()
l=[1]*n
r=[1]*(n+1)
ans=0
for i in range(1,n):
    if a[i]>a[i-1]:
        l[i]=l[i-1]+1
    else:
        l[i]=1
    ans=max(ans,l[i])
for i in range(n-2,-1,-1):
        if a[i+1]>a[i]:
            r[i]=r[i+1]+1
        else:
            r[i]=1
#print(l,r)
for i in range(1,n-1,1):
    if a[i+1]>a[i-1]:
        ans=max(ans,l[i-1]+r[i+1])
print(max(ans,1))