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.
//package codeforces.round605div3;

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

public class RemoveOneElementInterval {
    public static void main(String[] args) {
//        try {
//            FastScanner in = new FastScanner(new FileInputStream("src/input.in"));
//            PrintWriter out = new PrintWriter(new FileOutputStream("src/output.out"));

        FastScanner in = new FastScanner(System.in);
        PrintWriter out = new PrintWriter(System.out);

            solve(1, in, out);

//        } catch (IOException e) {
//            e.printStackTrace();
//        }
    }

    private static void solve(int q, FastScanner in, PrintWriter out) {
        for (int qq = 0; qq < q; qq++) {
            int n = in.nextInt();
            List<List<Integer>> intervals = new ArrayList<>();
            List<Integer> interval = new ArrayList<>();
            for(int i = 0; i < n; i++) {
                int v = in.nextInt();
                if(interval.size() == 0) {
                    interval.add(v);
                }
                else {
                    if(interval.get(interval.size() - 1) < v) {
                        interval.add(v);
                    }
                    else {
                        intervals.add(interval);
                        interval = new ArrayList<>();
                        interval.add(v);
                    }
                }
            }

            intervals.add(interval);
            int ans = 0;
            for(List<Integer> itl : intervals) {
                ans = Math.max(ans, itl.size());
            }
            List<Integer> prev = intervals.get(0);
            int i = 1;
            while(i < intervals.size()) {
                List<Integer> curr = intervals.get(i);
                if(prev.size() > 1 && prev.get(prev.size() - 2) < curr.get(0)) {
                    ans = Math.max(ans, prev.size() + curr.size() - 1);
                }
                if(curr.size() > 1 && curr.get(1) > prev.get(prev.size() - 1)) {
                    ans = Math.max(ans, prev.size() + curr.size() - 1);
                }
                prev = curr;
                i++;
            }
            out.println(ans);
        }
        out.close();
    }

    private static long modularAdd(long a, long b, int mod) {
        long sum = a + b;
        if (sum >= mod) {
            sum -= mod;
        }
        return sum;
    }

    private static long modularSubtract(long a, long b, int mod) {
        long diff = a - b;
        if (diff < 0) {
            diff += mod;
        }
        return diff;
    }

    static class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        FastScanner(InputStream stream) {
            try {
                br = new BufferedReader(new InputStreamReader(stream));
            } catch (Exception e) {
                e.printStackTrace();
            }
        }

        String next() {
            while (st == null || !st.hasMoreTokens()) {
                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;
        }
    }
}


