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.
'''input
7
6 5 4 3 2 4 3
'''

import sys
debug = 1
readln = sys.stdin.readline

def write(s):
    sys.stdout.write(str(s))

def writeln(s):
    sys.stdout.write(str(s))
    sys.stdout.write('\n')

def readint():
    return int(readln().strip())

def readints():
    return map(int, readln().split())

def readstr():
    return readln().strip()

def readstrs():
    return readln().split()

def dprint(*args):
    if debug: print(' '.join(map(str, args)))

def solve(a):
    tmp = []
    seqs = []
    ans = 0
    for i in xrange(len(a)):
        if i == 0 or a[i] > a[i-1]:
            tmp.append(a[i])
        else:
            ans = max(ans, len(tmp))
            seqs.append(tmp)
            tmp = [a[i]]
    if tmp: 
        ans = max(ans, len(tmp))
        seqs.append(tmp)

    if len(seqs) == 1:
        return ans

    for i in xrange(len(seqs) - 1):
        cseq = seqs[i]
        nseq = seqs[i+1]
        if len(cseq) == 1 or len(nseq) == 1: continue
        if cseq[-2] < nseq[0] or cseq[-1] < nseq[1]:
            ans = max(ans, len(cseq) + len(nseq) - 1)

    return ans

n = readint()
a = readints()
writeln(solve(a))