You are given an array a consisting of n integers.

You can remove at most one element from this array. Thus, the final length of the array is n-1 or n.

Your task is to calculate the maximum possible length of the strictly increasing contiguous subarray of the remaining array.

Recall that the contiguous subarray a with indices from l to r is a[l ... r] = a_l, a_{l + 1}, ..., a_r. The subarray a[l ... r] is called strictly increasing if a_l < a_{l+1} < ... < a_r.

Input

The first line of the input contains one integer n (2 ≤ n ≤ 2 ⋅ 10^5) — the number of elements in a.

The second line of the input contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^9), where a_i is the i-th element of a.

Output

Print one integer — the maximum possible length of the strictly increasing contiguous subarray of the array a after removing at most one element.

Examples

Input


5
1 2 5 3 4


Output


4


Input


2
1 2


Output


2


Input


7
6 5 4 3 2 4 3


Output


2

Note

In the first example, you can delete a_3=5. Then the resulting array will be equal to [1, 2, 3, 4] and the length of its largest increasing subarray will be equal to 4.
/*
 *created by Kraken on 13-05-2020 at 15:56
 */
//package com.kraken.cf.cf605;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;

public class D {

  public static void main(String[] args) {
    FastReader sc = new FastReader();
    int n = sc.nextInt();
    long[] x = new long[n + 2];
    boolean fine = true;
    for (int i = 1; i <= n; i++) {
      x[i] = sc.nextLong();
      if (i > 1 && x[i] <= x[i - 1]) fine = false;
    }
    if (fine) {
      System.out.println(n);
      return;
    }
    long[] pre = new long[n + 2];
    long[] suf = new long[n + 2];
    for (int i = 1; i <= n; i++) {
      if (x[i] > x[i - 1]) pre[i] = pre[i - 1] + 1;
      else pre[i] = 1;
    }
    for (int i = n; i > 0; i--) {
      if (x[i] < x[i + 1]) suf[i] = suf[i + 1] + 1;
      else suf[i] = 1;
    }
//    System.out.println(Arrays.toString(pre));
//    System.out.println(Arrays.toString(suf));
    long res = 0;
    for (int i = 1; i <= n; i++) {
      if (x[i - 1] < x[i + 1]) {
        res = Math.max(res, pre[i - 1] + suf[i + 1]);
      } else {
        res = Math.max(res, Math.max(pre[i - 1], suf[i + 1]));
      }
    }
    System.out.println(res);
  }

  static class FastReader {

    BufferedReader br;

    StringTokenizer st;

    public FastReader() {
      br = new BufferedReader(new InputStreamReader(System.in));
    }

    String next() {
      while (st == null || !st.hasMoreElements()) {
        try {
          st = new StringTokenizer(br.readLine());
        }
        catch (IOException e) {
          e.printStackTrace();
        }
      }
      return st.nextToken();
    }

    int nextInt() {
      return Integer.parseInt(next());
    }

    long nextLong() {
      return Long.parseLong(next());
    }

    double nextDouble() {
      return Double.parseDouble(next());
    }

    String nextLine() {
      String str = "";
      try {
        str = br.readLine();
      }
      catch (IOException e) {
        e.printStackTrace();
      }
      return str;
    }
  }
}
