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.

// Working program with FastReader 
import java.io.*;
import java.util.*;

public class C {
	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;
		}
	}

	public static List<Integer> list = new ArrayList<Integer>();

	public static void main(String[] args) {
		FastReader s = new FastReader();
		int n = s.nextInt();
		for (int i = 0; i < n; i++) {
			int val = s.nextInt();
			list.add(val);
		}

		int result = solve(list, n, n);
		System.out.println(result);
	}

	public static int solve(List<Integer> list, int n, int f) {
		int ar[] = new int[200005];
		int rev[] = new int[200005];
		for (int i = 0; i < list.size() + 2; i++) {
			ar[i] = 1;
			rev[i] = 1;
		}

		for (int i = 0; i < list.size() - 1; i++) {
			if (list.get(i) < list.get(i + 1)) {
				ar[i + 1] = ar[i] + 1;
			} else {
				ar[i+1] = 1;
			}
		}

		for (int i = list.size() - 1; i >= 1; i--) {
			if (list.get(i) > list.get(i - 1)) {
				rev[i - 1] = rev[i] + 1;
			} else {
				rev[i-1] = 1;
			}
		}

		int res = 0;

		res = Math.max(ar[n - 1], rev[0]);

		for (int i = 1; i < list.size() - 1; i++) {

			
			if (list.get(i-1) < list.get(i + 1)) {
				res = Math.max(res, ar[i-1] + rev[i + 1]);
			}
			res = Math.max(res, rev[i]);
			res = Math.max(res, ar[i]);

		}

		return res;
	}
}