#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<int> arr(n);
  vector<int> prefix(n, 1);
  vector<int> suff(n, 1);
  for (int i = 0; i < n; i++) cin >> arr[i];
  int ans = 0;
  for (int i = 1; i < n; i++) {
    if (arr[i] > arr[i - 1]) prefix[i] = prefix[i - 1] + 1;
    ans = max(ans, prefix[i]);
  }
  for (int i = n - 2; i >= 0; i--) {
    if (arr[i] < arr[i + 1]) suff[i] = suff[i + 1] + 1;
  }
  for (int i = 1; i < n - 1; i++) {
    if (arr[i - 1] < arr[i + 1])
      ans = max(ans, prefix[i - 1] + suff[i + 1]);
    else
      ans = max(ans, 1);
  }
  cout << ans << endl;
}
