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.
'''q=int(input())
while(q):
        q-=1
        a,b,c=[int(x) for x in input().split()]
        ans=abs(a-b)+abs(b-c)+abs(a-c)-4
        if ans>0:
                print(ans)
        else:
                print(0)'''

'''n,k=[int(x) for x in input().split()]
s=input()
string=input().split()
i=0
x=0
ans=0
while(i<len(s)):
        j=i
        x=0
        while(j<len(s)):
                if s[j] in string:
                        x+=1
                        j+=1
                else:
                        break
        ans+=x*(x+1)//2
        i=j+1
print(ans)'''

n=int(input())
arr=[int(x) for x in input().split()]
pre=[0]*(n)
pos=[0]*(n)
pre[0]=1
pos[n-1]=1
for i in range(1,n):
        if arr[i]>arr[i-1]:
            pre[i]=pre[i-1]+1
        else:
            pre[i]=1
for i in range(n-2,-1,-1):
    if arr[i+1]>arr[i]:
        pos[i]=pos[i+1]+1
    else:
        pos[i]=1
l=1
ans=0
for i in range(1,n):
    if arr[i]>arr[i-1]:
        l+=1
    else:
        l=1
    ans=max(ans,l)
#print(pre,pos,l)
for i in range(1,n-1):
    if arr[i-1]<arr[i+1]:
        ans=max(pre[i-1]+pos[i+1],ans)
    
print(ans)
'''n=int(input())
arr=[int(x) for x in input().split()]

def solve(j,x,m):
                if  j-arr[j]>=0 and j+arr[j]<n:
                        if j-arr[j]>=0:
                                t=arr[j-arr[j]]%2
                                y=arr[j]%2
                                if (t==0 and (y&1)) or ((t&1) and y==0):
                                        x+=1
                                        m=min(m,x)
                                else:
                                       x+=1
                                       m=solve(j-arr[j],x,m)
                                       if j==3:
                                           print(m)
                        if j+arr[j]<n:
                                t=arr[j+arr[j]]%2
                                y=arr[j]%2
                                if (t==0 and (y&1)) or ((t&1) and y==0):
                                        x+=1
                                        m=min(m,x)
                                else:
                                       x+=1
                                       m=solve(j+arr[j],x,m)
                                       if j==3:
                                           print(m)
                        return m
                        
                elif j-arr[j]>=0:
                        #print(j-arr[j])
                        t=arr[j-arr[j]]%2
                        y=arr[j]%2
                        if (t==0 and (y&1)) or ((t&1) and y==0):
                                x+=1
                                return x
                        else:
                               x+=1
                               return(solve(j-arr[j],x,m))
                elif j+arr[j]<n:
                        #print(j+arr[j])
                        t=arr[j+arr[j]]%2
                        y=arr[j]%2
                        if (t==0 and (y&1)) or ((t&1) and y==0):
                                
                               x+=1
                               return x
                        else:
                               x+=1
                               return(solve(j+arr[j],x,m))
                else:
                        return -1
                       
for i in range(n):
        x=0
        m=100000000000000
        print(solve(i,x,m),end=" ")'''
