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.
#include <bits/stdc++.h>
using namespace std;
ifstream fin("frac1.in");
ofstream fout("frac1.out");
class compare : public std::binary_function<double, double, bool> {
 public:
  compare(double arg = 1e-7) : e(arg) {}
  bool operator()(const double &left, const double &right) const {
    return (abs(left - right) > e) && (left < right);
  }
  double e;
};
inline long long myabs(long long a) { return (a < 0) ? -a : a; }
inline int d_compare(double x, double y) {
  return (fabs(x - y) <= 1e-7) ? 0 : (x > y) ? 1 : -1;
}
inline int mod(long long x, int y) {
  if (y == 0) return x;
  if (x < 0) x = -x;
  if (x >= y) x %= y;
  return x;
}
inline int cmod(int x, int y) {
  if (y == 0) return x;
  if (x < 0) x += (abs(x) / y + 1) * y;
  if (x >= y) x = x % y;
  return x;
}
int Bcount(int mask) {
  int n = 0;
  while (mask) n += ((mask & -mask) != 0), mask &= ~(mask & -mask);
  return n;
}
inline bool Bstate(int mask, int idx) { return (mask & (1 << idx)); }
inline int B1(int mask, int idx) { return mask | (1 << idx); }
inline int B0(int mask, int idx) { return mask & ~(1 << idx); }
inline int drift(int mask, int n) { return mask & ((1 << n) - 1); }
void debugmask(int mask, int n) {
  for (int i = 0; i < n; i++) cout << Bstate(mask, i);
}
int dr[8] = {0, 0, -1, 1, -1, 1, -1, 1}, dc[8] = {-1, 1, 0, 0, 1, -1, -1, 1};
template <typename Ty>
void clear(Ty &q) {
  Ty empty;
  swap(q, empty);
}
int main() {
  int n;
  cin >> n;
  vector<int> vec(n);
  for (int i = 0; i < n; i++) cin >> vec[i];
  int b[n], f[n];
  b[0] = f[n - 1] = 1;
  for (int i = 1; i < n; i++) b[i] = 1 + ((vec[i] > vec[i - 1]) ? b[i - 1] : 0);
  for (int i = n - 2; i >= 0; i--)
    f[i] = 1 + ((vec[i] < vec[i + 1]) ? f[i + 1] : 0);
  int maxi = 1;
  if (n > 1) maxi = max(f[1] + 1, b[n - 2] + 1);
  for (int i = 1; i < n - 1; i++)
    if (vec[i - 1] + 1 < vec[i + 1])
      maxi = max(maxi, b[i - 1] + f[i + 1] + 1);
    else
      maxi = max(maxi, max(b[i - 1] + 1, f[i + 1] + 1));
  cout << maxi << endl;
  return 0;
}
