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 print_function # for PyPy2
from collections import Counter, OrderedDict
from itertools import permutations as perm
from collections import deque
from sys import stdin
from bisect import *
from heapq import *
import math
 
g   = lambda : stdin.readline().strip()
gl  = lambda : g().split()
gil = lambda : [int(var) for var in gl()]
gfl = lambda : [float(var) for var in gl()]
gcl = lambda : list(g())
gbs = lambda : [int(var) for var in g()]
mod = int(1e9)+7
inf = float("inf")

n, = gil()
a = [-inf] + gil();a.append(inf)
l, r = [0]*(n+2), [0]*(n+2)

for i in xrange(1, n+1):
	if a[i] > a[i-1]:
		l[i] = l[i-1] + 1
	else: l[i] = 1

for i in reversed(xrange(1, n+1)):
	if a[i] < a[i+1]:
		r[i] = r[i+1] + 1
	else: r[i] = 1

ans = 1

for i in xrange(1, n+1):
	ans = max(ans, l[i]+r[i+1] if a[i] < a[i+1] else 0, l[i-1]+r[i+1] if a[i-1] < a[i+1] else 0)
	# ans = max(ans, l[i-1]+r[i+1] if a[i-1] < a[i+1] else 0)

# print(l)
# print(r)
print(ans)