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.
import java.io.*;


import java.math.BigInteger;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Comparator;
import java.util.Deque;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.Queue;
import java.util.Set;
import java.util.SortedSet;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;
import java.util.concurrent.LinkedBlockingQueue;

public class Main {
    public static void main(String[] argv) {
        MainRun mainSolve = new MainRun();
        mainSolve.run(0, 0);
    }
}

class Task {		
	public void solve(InputReader in, PrintWriter out) {
		int n = in.nextInt();
		if (n <= 2) {
			out.println(n);
			return;
		}
		int a[] = new int[n + 2];
		for (int i = 1; i <= n; i++)
			a[i] = in.nextInt();
		int b[] = new int[n + 2];
		int c[] = new int[n + 2];
		int ans = 0;
		c[1] = 1;
		b[1] = 1;
		for (int i = 2; i <= n; i++) {
			if (a[i] > a[i - 1])
				c[i] = c[i - 1] + 1;
			else
				c[i] = 1;
			ans = Math.max(ans, c[i]);
			b[i] = c[i];
		}
		int q = 2;
		for (int i = 3; i <= n; i++) {
			if (a[i] <= a[i - 1])
				break;
			else
				q++;
		}
		ans = Math.max(ans, q);
		for (int i = n; i >= 2; i--)
		if (a[i] <= a[i - 1])
			ans = Math.max(ans, c[i - 1] + 1);
		for (int i = n; i >= 1; i--) {
			if (c[i] != 1) {
				i--;
				while (i > 0) {
					boolean enough = c[i] == 1;
					c[i] = c[i + 1];
					if (enough)
						break;
					i--;
				}	
			}
		}
		for (int i = 2; i <= n; i++) {
			if (a[i] < a[i + 1])
				continue;
			ans = Math.max(ans, c[i + 1] + 1);
		}
		for (int i = 2; i <= n - 1; i++) {
			if (a[i] > a[i - 1] && a[i] < a[i + 1])
				continue;
			int ed = (a[i] < a[i + 1] ? 0 : 1);
			if (a[i + 1] - a[i - 1] > 1)
				ans = Math.max(ans, b[i - 1] + c[i + 1] + ed);
		}
		out.println(ans);
	}
}

class MainRun {
	void run(int inF, int outF) {
//		inF = outF = 0;
		String input = "input.txt";
//		String input = "puzzle-2048.in";	
		String output = "output.txt";
//		String output = "puzzle-2048.out";
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in;
		PrintWriter out;
		if (inF == 1)	
			in = new InputReader(input);
		else
			in = new InputReader(inputStream);
		if (outF == 1)
			out = getPrintWriter(output);
		else
			out = getPrintWriter(outputStream);
		Task solver = new Task();
		solver.solve(in, out);
		out.close();
	}
	public static PrintWriter getPrintWriter(OutputStream stream) {
		return new PrintWriter(stream);
	}
	public static PrintWriter getPrintWriter(String f) {
		try {
			return new PrintWriter(new File(f));
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
		return null;
	}	
}

class InputReader {
	BufferedReader reader;
	StringTokenizer tokenizer;
	InputReader(InputStream stream) {
		reader = new BufferedReader(new InputStreamReader(stream));
		tokenizer = null;
	}
	InputReader(String f) {
		try {
			reader = new BufferedReader(new FileReader(f));
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
		tokenizer = null;		
	}
	public String next() {
		while (tokenizer == null || !tokenizer.hasMoreTokens()) {
			try {
				tokenizer = new StringTokenizer(reader.readLine());
			} catch(IOException e) {
				throw new RuntimeException(e);
			}
		}
		return tokenizer.nextToken();
	}
	public String getLine() {
		try {
			return (String)reader.readLine();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		return "";
	}	
	public int nextInt() {
		return Integer.parseInt(next());
	}
	public char nextChar() {
		return next().charAt(0);
	}	
	public long nextLong() {
		return Long.parseLong(next());
	}
	public double nextDouble() {
		return Double.parseDouble(next());
	}
	public int[] nextIntArray(int n) {
		int a[] = new int[n + 2];
		for (int i = 1; i <= n; i++)
			a[i] = nextInt();
		return a;
	}
}