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.
/* Rajkin Hossain */

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

import static java.lang.Math.*;

public class D {
   
    FastInput k = new FastInput(System.in);
    //FastInput k = new FastInput("/home/rajkin/Desktop/input.txt");
    FastOutput z = new FastOutput();
    
    int n;
    long [] y;
    
    int [] left, right;
    
    void startAlgo() {
    	long prev = y[0];
    	left[0] = 1;
    	long max = 1;
    	
		for(int i = 1; i<n; i++) {
			if(y[i] > prev) {
				prev = y[i];
				left[i] = left[i-1] + 1;
				max = Math.max(left[i], max);
			}
			else {
				prev = y[i];
				left[i] = 1;
			}
		}
		
    	prev = y[n-1];
    	right[n-1] = 1;
		for(int i = n-2; i>=0; i--) {
			if(y[i] < prev) {
				prev = y[i];
				right[i] = right[i+1] + 1;
			}
			else {
				prev = y[i];
				right[i] = 1;
			}
		}
		
		for(int i = 1; i<n-1; i++) {
			if(y[i-1] < y[i+1]) {
				max = Math.max(max, left[i-1] + right[i+1]);
			}
			
			if(y[i-1] < y[i] && y[i] < y[i+1]) {
				max = Math.max(max, left[i-1] + right[i+1] + 1);
			}
		}
		
		z.println(max);
    }
    
	void startProgram() {
		
		while(k.hasNext()) {
			n = k.nextInt();
			
			y = new long[n];
			
			left = new int[n];
			right = new int[n];
			
			for(int i = 0; i<n; i++) {
				y[i] = k.nextLong();
			}
			
			startAlgo();
		}
    	
    	z.flush();
    	System.exit(0);
    }
    
    public static void main(String [] args) throws IOException {
        new Thread(null, new Runnable(){
            public void run(){
            	try{ 
            		new D().startProgram();
            	}
            	catch(Exception e){
            		e.printStackTrace();
            	}
            }
        },"Main",1<<28).start();
    }
    

    /* MARK: FastInput and FastOutput */
 
    class FastInput {
        BufferedReader reader;
        StringTokenizer tokenizer;
 
        FastInput(InputStream stream){
            reader = new BufferedReader(new InputStreamReader(stream));
        }
       
        FastInput(String path){
            try {
                reader = new BufferedReader(new FileReader(path));
            } catch (FileNotFoundException e) {
                // TODO Auto-generated catch block
                e.printStackTrace();
            }
            tokenizer = null;
        }
 
        String next() {
            return nextToken();
        }
       
        String nextLine() {
            try {
                return reader.readLine();
            } catch (IOException e) {
                // TODO Auto-generated catch block
                e.printStackTrace();
            }
           
            return null;
        }
 
        boolean hasNext(){
            try {
                return reader.ready();
            } catch (IOException e) {
                // TODO Auto-generated catch block
                e.printStackTrace();
            }
            return false;
        }
 
        String nextToken() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                String line = null;
                try {
                    line = reader.readLine();
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
                if (line == null) {
                    return null;
                }
                tokenizer = new StringTokenizer(line);
            }
            return tokenizer.nextToken();
        }
 
        int nextInt() {
            return Integer.parseInt(nextToken());
        }
       
        long nextLong() {
            return Long.valueOf(nextToken());
        }
        
        double nextDouble() {
            return Double.valueOf(nextToken());
        }
    }
 
    class FastOutput extends PrintWriter {
		FastOutput() {
			super(new BufferedOutputStream(System.out)); 
		}
		
		public void debug(Object...obj) {
		    System.err.println(Arrays.deepToString(obj));
		}
    }
}
