#include <iostream>
#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
using namespace std;
#pragma warning (disable: 4996)

int N, A[1 << 20];
int cl[1 << 20], cr[1 << 20];
int dl[1 << 20], dr[1 << 20];

int main() {
	cin >> N;
	for (int i = 1; i <= N; i++) cin >> A[i];

	cl[1] = 1;
	for (int i = 2; i <= N; i++) {
		if (A[i - 1] < A[i]) cl[i] = cl[i - 1] + 1;
		else cl[i] = 1;
	}

	cr[N] = 1;
	for (int i = N - 1; i >= 1; i--) {
		if (A[i + 1] < A[i]) cr[i] = cr[i + 1] + 1;
		else cr[i] = 1;
	}

	dl[1] = 1;
	for (int i = 2; i <= N; i++) {
		if (A[i - 1] > A[i]) dl[i] = dl[i - 1] + 1;
		else dl[i] = 1;
	}

	dr[N] = 1;
	for (int i = N - 1; i >= 1; i--) {
		if (A[i + 1] > A[i]) dr[i] = dr[i + 1] + 1;
		else dr[i] = 1;
	}

	int maxn = 0;
	for (int i = 1; i <= N; i++) {
		maxn = max(maxn, min(cl[i], cr[i]));
		maxn = max(maxn, min(dl[i], dr[i]));
	}
	cout << maxn - 1 << endl;
	return 0;
}