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 __future__ import division, print_function
import bisect
import math
import itertools
import sys
from atexit import register
 
if sys.version_info[0] < 3:
    from io import BytesIO as stream
else:
    from io import StringIO as stream
 
 
if sys.version_info[0] < 3:
    class dict(dict):
        """dict() -> new empty dictionary"""
        def items(self):
            """D.items() -> a set-like object providing a view on D's items"""
            return dict.iteritems(self)
 
        def keys(self):
            """D.keys() -> a set-like object providing a view on D's keys"""
            return dict.iterkeys(self)
 
        def values(self):
            """D.values() -> an object providing a view on D's values"""
            return dict.itervalues(self)
 
    input = raw_input
    range = xrange
 
    filter = itertools.ifilter
    map = itertools.imap
    zip = itertools.izip
 
 
def sync_with_stdio(sync=True):
    """Set whether the standard Python streams are allowed to buffer their I/O.
 
    Args:
        sync (bool, optional): The new synchronization setting.
 
    """
    global input, flush
 
    if sync:
        flush = sys.stdout.flush
    else:
        sys.stdin = stream(sys.stdin.read())
        input = lambda: sys.stdin.readline().rstrip('\r\n')
 
        sys.stdout = stream()
        register(lambda: sys.__stdout__.write(sys.stdout.getvalue()))
 
def main():
    n=int(input()) 
    #ans=[]
    #n,k=map(int, input().split())
    a=list(map(int, input().split()))
    b=[]
    l=0
    for i in range(n-1):
        if a[i]<a[i+1]:
            continue
        else:
            r=i
            b.append([l,r])
            l=i+1
    if a[-1]>a[-2]:
        b.append([l,n-1])
    else:
        b.append([n-1,n-1])
    #print(b)
    ans=[]
    for i in range(len(b)):
        ans.append(b[i][1]-b[i][0]+1)
    for i in range(len(b)-2):
        if b[i+1][0]==b[i+1][1]:
            if a[b[i][1]]<a[b[i+2][0]]:
                ans.append((b[i+2][1]-b[i+2][0]+1)+(b[i][1]-b[i][0]+1))
    for i in range(len(b)-1):
        if b[i][1]!=b[i][0] and b[i+1][0]!=b[i+1][1]:
            if a[b[i][1]-1]<a[b[i+1][0]]:
                ans.append((b[i+1][1]-b[i+1][0]+1)+(b[i][1]-b[i][0]))
            elif a[b[i+1][0]+1]>a[b[i][1]]:
                ans.append((b[i+1][1]-b[i+1][0]+1)+(b[i][1]-b[i][0]))      
    print(max(ans))        
 
   
if __name__ == '__main__':
    sync_with_stdio(False)
    main()