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

'''

from sys import stdin, stdout
get_string = lambda : stdin.readline().strip()
get_intmap = lambda : map(int, get_string().split())

def testcase():
	n = int(input())
	t = tuple(get_intmap())
	last_seen_val_left, curr_max_left = 0,0
	dp_left = [0]*n
	for ind in range(n):
		if last_seen_val_left >= t[ind]:
			curr_max_left = 1
		else:
			curr_max_left += 1
		dp_left[ind]  = curr_max_left
		last_seen_val_left = t[ind]
	
	last_seen_val_right, curr_max_right = int(1e10),0
	dp_right = [0]*n
	for ind in range(n-1,-1,-1):
		if t[ind] >= last_seen_val_right:
			curr_max_right = 1
		else:
			curr_max_right += 1
		dp_right[ind]  = curr_max_right
		last_seen_val_right = t[ind]
	
	result = max(dp_left) # or max(dp_right) can also be used
	for ind in range(1,n-1):
		tmp = dp_left[ind-1] + ( dp_right[ind+1] if t[ind + 1] > t[ind - 1] else 0)
		# print(result,tmp,ind)
		result = max(result, tmp)
	print(result)
# for t in range(int(input())):
# 	testcase()
testcase()