#include <bits/stdc++.h>
using namespace std;
struct myComp {
  constexpr bool operator()(
      pair<long long, pair<long long, long long>> const& a,
      pair<long long, pair<long long, long long>> const& b) const noexcept {
    if ((a.first) != b.first)
      return (((a).first) > (b).first);
    else
      return a.second < b.second;
  }
};
void _print(long long t) { cerr << t; }
void _print(int t) { cerr << t; }
void _print(string t) { cerr << t; }
void _print(char t) { cerr << t; }
void _print(long double t) { cerr << t; }
void _print(double t) { cerr << t; }
void _print(unsigned long long t) { cerr << t; }
template <class T>
void _print(unordered_set<T> v);
template <class T>
void _print(multiset<T, greater<T>> v);
template <class T>
void _print(multiset<T, myComp> v);
template <class T, class V>
void _print(pair<T, V> p);
template <class T>
void _print(vector<T> v);
template <class T>
void _print(set<T> v);
template <class T>
void _print(set<T, myComp> v);
template <class T, class V>
void _print(map<T, V> v);
template <class T>
void _print(multiset<T> v);
template <class T, class V>
void _print(pair<T, V> p) {
  cerr << "{";
  _print(p.first);
  cerr << ",";
  _print(p.second);
  cerr << "}";
}
template <class T>
void _print(vector<T> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T>
void _print(set<T> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T>
void _print(multiset<T> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T, class V>
void _print(map<T, V> v) {
  cerr << "[ ";
  for (auto i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T>
void _print(set<T, greater<T>> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T>
void _print(multiset<T, myComp> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T>
void _print(set<T, myComp> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
template <class T>
void _print(unordered_set<T> v) {
  cerr << "[ ";
  for (T i : v) {
    _print(i);
    cerr << " ";
  }
  cerr << "]";
}
long long inf = 1e18;
long long md = 1e9 + 7;
void solve() {
  int n;
  cin >> n;
  vector<long long> a(n);
  for (int i = 0; i < n; i++) cin >> a[i];
  vector<long long> pre(n, 1);
  for (int i = 1; i < n; i++) {
    if (a[i] > a[i - 1]) {
      pre[i] = pre[i - 1] + 1;
    }
  }
  vector<long long> suf(n, 1);
  for (int i = n - 2; i >= 0; i--) {
    if (a[i] < a[i + 1]) suf[i] = 1 + suf[i + 1];
  }
  long long ans = *max_element(pre.begin(), pre.end());
  for (int i = 1; i < n - 1; i++) {
    long long ad = pre[i - 1];
    ad = max(ad, suf[i + 1]);
    if (a[i - 1] < a[i + 1]) ad = max(ad, suf[i + 1] + pre[i - 1]);
    ans = max(ad, ans);
  }
  cout << ans << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  while (t--) {
    solve();
  }
}
