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.PrintStream;
import java.io.BufferedReader;
import java.util.Comparator;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Writer;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
import java.io.Reader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author Nipuna Samarasekara
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		FastScanner in = new FastScanner(inputStream);
		FastPrinter out = new FastPrinter(outputStream);
		TaskC solver = new TaskC();
		solver.solve(1, in, out);
		out.close();
	}
}

class TaskC {

    /////////////////////////////////////////////////////////////

    public void solve(int testNumber, FastScanner in, FastPrinter out) {
        int sp = 0;
        int n = in.nextInt();
        int[] A = in.readIntArray(n);
        int ans = 0;
        int p = -1;
        while (sp < n) {
            int spc=sp;
            sp = n;

            int ll = 0;
            int flag = 0;
            p = -1;
            for (int i = spc; i < n; i++) {
            //   System.out.println(spc+" "+A[i]+" "+p+" "+ll);
                if (A[i] > p) {
                 //   System.out.println(spc+" "+A[i]+" "+p+" 1aaaa"+ll);

                    ll++;
                    p=A[i];
                    continue;
                } else {
                //    System.out.println(spc+" "+A[i]+" "+p+" 2bbbb "+ll);

                    if (flag == 0) {
                        sp = i;
                        flag = 1;
                        ll++;
                        p++;
                    } else break;
                }
             }
            if(flag==0&&spc>0)ll++;
            ans = Math.max(ans, ll);

        }
        sp=0;
        ArrayUtils.reverse(A);
        int max=ArrayUtils.maxElement(A);
        for (int i = 0; i < n; i++) {
            A[i]=max-A[i];
        }
        p = -1;
        while (sp < n) {
            int spc=sp;
            sp = n;

            int ll = 0;
            int flag = 0;
            p = -1;
            for (int i = spc; i < n; i++) {
           //     System.out.println(spc+" "+A[i]+" "+p+" "+ll);
                if (A[i] > p) {
                  //  System.out.println(spc+" "+A[i]+" "+p+" 1aaaa"+ll);

                    ll++;
                    p=A[i];
                    continue;
                } else {
                 //   System.out.println(spc+" "+A[i]+" "+p+" 2bbbb "+ll);

                    if (flag == 0) {
                        sp = i;
                        flag = 1;
                        ll++;
                        p++;
                    } else break;
                }
            }
            if(flag==0&&spc>0)ll++;
            ans = Math.max(ans, ll);

        }
        out.println(ans);
    }
}

class FastScanner extends BufferedReader {

    public FastScanner(InputStream is) {
        super(new InputStreamReader(is));
    }

    public int read() {
        try {
            int ret = super.read();
//            if (isEOF && ret < 0) {
//                throw new InputMismatchException();
//            }
//            isEOF = ret == -1;
            return ret;
        } catch (IOException e) {
            throw new InputMismatchException();
        }
    }

    static boolean isWhiteSpace(int c) {
        return c >= 0 && c <= 32;
    }

    public int nextInt() {
        int c = read();
        while (isWhiteSpace(c)) {
            c = read();
        }
        int sgn = 1;
        if (c == '-') {
            sgn = -1;
            c = read();
        }
        int ret = 0;
        while (c >= 0 && !isWhiteSpace(c)) {
            if (c < '0' || c > '9') {
                throw new NumberFormatException("digit expected " + (char) c
                        + " found");
            }
            ret = ret * 10 + c - '0';
            c = read();
        }
        return ret * sgn;
    }

    public String readLine() {
        try {
            return super.readLine();
        } catch (IOException e) {
            return null;
        }
    }

    public int[] readIntArray(int n) {
        int[] ret = new int[n];
        for (int i = 0; i < n; i++) {
            ret[i] = nextInt();
        }
        return ret;
    }

}

class FastPrinter extends PrintWriter {

    public FastPrinter(OutputStream out) {
        super(out);
    }

    public FastPrinter(Writer out) {
        super(out);
    }


}

class ArrayUtils {

    public static int maxElement(int[] array) {
		return maxElement(array, 0, array.length);
	}

	public static int maxElement(int[] array, int from, int to) {
		int result = Integer.MIN_VALUE;
		for (int i = from; i < to; i++)
			result = Math.max(result, array[i]);
		return result;
	}

    public static void reverse(int[] array) {
		for (int i = 0, j = array.length - 1; i < j; i++, j--) {
			int temp = array[i];
			array[i] = array[j];
			array[j] = temp;
		}
	}

}

