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.
import sys
import bisect as bi
import math
from collections import defaultdict as dd
input=sys.stdin.readline
##sys.setrecursionlimit(10**7)
def cin():
    return map(int,sin().split())
def ain():            
    return list(map(int,sin().split()))
def sin():
    return input()
def inin():
    return int(input())
for _ in range(1):
    n=inin()
    l=ain()
    pre=[0]*n;post=[0]*n
    pre[0]=1;post[-1]=1
    for i in range(1,n):
        if(l[i-1]<l[i]):pre[i]=pre[i-1]+1
        else:pre[i]=1
    for i in range(n-2,-1,-1):
        if(l[i+1]>l[i]):post[i]=post[i+1]+1
        else:post[i]=1
##    print(l);print(pre);print(post)
    if(n==2):
        if(l[0]<l[1]):print(2)
        else:print(1)
    else:
        ans=1
        for i in range(0,n):
            if(i==0):ans=max(ans,post[1],post[0])
            elif(i==n-1):ans=max(ans,pre[-2],pre[-1])
            elif(l[i+1]>l[i-1]):ans=max(pre[i-1]+post[i+1],ans,pre[i])
            else:ans=max(ans,pre[i])
        print(ans)
    
    
            
    

    
####    s=input()
####    def minCut( s: str) -> int:
####    
####        n=len(s)
####        dp=[[-1]*(n+2) for i in range(n+2)]
####        def pp(s,i,j,dp,mn):
####            if(i>=j or s[i:j+1]==s[i:j+1:-1]):return 0
####            if(dp[i][j]!=-1):return dp[i][j]
####            for k in range(i,j):
####                if(dp[i][k]!=-1):return dp[i][k]
####                else:
####                    dp[i][k]=pp(s,i,k,dp,mn)
####                    return dp[i][k]
####                if(dp[k+1][j]!=-1):return dp[k+1][j]
####                else:
####                    dp[i][k]=pp(s,k+1,j,dp,mn)
####                    return dp[i][k]
####                temp=dp[i][k] + dp[i][k] +1
####                if(temp<mn):mn=tmp
####            dp[0][n]=mn
####            return dp[0][n]
####        x=pp(s,0,n,dp,999999999999999)
####        for i in dp:print(i)
####        return x
####    
####    print(minCut(s))
##dp=[[0 if (i==j) else -1 for j in range(n+1)] for i in range(n+1)]
##for i in range(1,n):
##    for j in range(
##
##
##
##
##        
##    
##    
####n=m=0
####s=''
####t=''
####dp=[]
####def solve(inds,indt,k,cont):
####    ans=-999999999999999
####    print(dp)
####    if(k<0):return 0
####    elif(inds>=n and indt>=m):return 0
####    elif(dp[inds][indt][k][cont]!=-1):return dp[inds][indt][k][cont]
####    else:
####        if(indt<m):ans=max(ans,solve(inds,indt+1,k,0))
####        if(inds<n):ans=max(ans,solve(inds+1,indt,k,0))
####        if(s[inds]==t[indt]):
####            ans=max(ans,solve(inds+1,indt+1,k-1,1)+1)
####            if(cont):ans=max(ans,solve(inds+1,indt+1,k,1)+1)
####        dp[inds][indt][k][cont]=ans
####        return ans    
##
####    n,m,k=cin()
####    s=sin().strip()
####    t=sin().strip()
####    dp=[[[[-1]*2 for i in range(k)] for i in range(m+1)] for i in range(n+1)]
####    c=0
####    for i in dp:
####        for j in i:
####            for l in j:
####                c+=1
####                print(l,c)
####    print(solve(0,0,k,0))




