Codeforces Round #FF (Div. 2)-C. DZY Loves Sequences

原题链接

C. DZY Loves Sequences

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

DZY has a sequence a, consisting of n integers.

We'll call a sequence ai, ai + 1, ..., aj (1 ≤ i ≤ j ≤ n) a subsegment of the sequence a. The value (j - i + 1) denotes the length of the subsegment.

Your task is to find the longest subsegment of a, such that it is possible to change at most one number (change one number to any integer you want) from the subsegment to make the subsegment strictly increasing.

You only need to output the length of the subsegment you find.

Input

The first line contains integer n (1 ≤ n ≤ 105). The next line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 109).

Output

In a single line print the answer to the problem — the maximum length of the required subsegment.

Examples

input

6
7 2 3 1 5 6

output

5

Note

You can choose subsegment a2, a3, a4, a5, a6 and change its 3rd element (that is a4) to 4.

dp[i][1]表示以以第i个数字为结尾，第i个数字不改变大小的最长子段

dp[i][2]表示以以第i个数字为结尾，第i个数字改变大小的最长子段

dp[i][3]表示以以第i个数字为结尾，所有数字不改变大小的最长子段

#include <bits/stdc++.h>
#define maxn 100005
using namespace std;
typedef long long ll;

int dp[maxn][4], num[maxn];
int main(){
   // freopen("in.txt", "r", stdin);
	int n;
	scanf("%d", &n);
	for(int i = 1; i <= n; i++)
	 scanf("%d", num+i);
	num[0] = -1;
	dp[1][1] = dp[1][2] = dp[1][3] = 1;
	int maxs = 1;
	for(int i = 2; i <= n; i++){
		dp[i][1] = dp[i][3] = 1;
		if(num[i] > num[i-1]){
			dp[i][3] = dp[i-1][3] + 1;
			dp[i][1] = dp[i-1][1] + 1;			
		}
		dp[i][2] = dp[i-1][3] + 1;
		if(num[i] - num[i-2] >= 2)
		 dp[i][1] = max(dp[i][1], dp[i-1][2] + 1);
		else
		 dp[i][1] = max(dp[i][1], 2);
		for(int j = 1; j <= 3; j++){
			maxs = max(maxs, dp[i][j]);
		}
	}
	cout << maxs << endl;
	return 0;
}