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.
// This template code suggested by KT BYTE Computer Science Academy
//   for use in reading and writing files for USACO problems.

// https://content.ktbyte.com/problem.java

import java.util.*;
import java.io.*;

public class RemoveOneElement {

    static StreamTokenizer in;

    static int nextInt() throws IOException {
        in.nextToken();
        return (int) in.nval;
    }

    public static void main(String[] args) throws Exception {
        in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
        PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));

        int n = nextInt();

        int[] nums = new int[n];

        for (int i = 0; i < n; i++) {
            nums[i] = nextInt();
        }

        int[] endHere = new int[n];
        endHere[0] = 1;

        for (int i = 1; i < n; i++) {
            if (nums[i] > nums[i-1]) endHere[i] = endHere[i-1] + 1;
            else endHere[i] = 1;
        }

        int[] startHere = new int[n];
        startHere[n-1] = 1;

        for (int i = n-2; i >= 0; i--) {
            if (nums[i] < nums[i+1]) startHere[i] = 1 + startHere[i+1];
            else startHere[i] = 1;
        }

        int result = Math.max(endHere[0], endHere[n-1]);

        for (int i = 1; i < n-1; i++) {
            int norm = endHere[i];
            int removal = 0;

            if (nums[i-1] < nums[i+1]) {
                removal = endHere[i-1] + startHere[i+1];
            }

            result = Math.max(result, Math.max(norm, removal));
        }

        out.println(result);

        out.close();
    }
}