import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.NoSuchElementException;
import java.util.TreeSet;

class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDouble() { return Double.parseDouble(next());}
}

class Main {
	public static void main(String[] args) {
		new Main().run();
	}
	
	int[] shrink(int[] A) {
		int N=A.length;
		int[] C=new int[N];
		HashSet<Integer> set=new HashSet<>();
		for (int a:A) set.add(a);
		int[] B=new int[set.size()];
		int p=0;
		for (int v:set) {
			B[p++]=v;
		}
		Arrays.sort(B);
		for (int i=0;i<N;++i) {
			C[i]=Arrays.binarySearch(B, A[i]);
		}
		return C;
	}
	
	int f(int[] A) {
		int N=A.length;
		ArrayList<Integer>[] list=new ArrayList[N];
		for (int i=0;i<N;++i) list[i]=new ArrayList<Integer>();
		for (int i=0;i<N;++i) {
			list[A[i]].add(i);
		}
		TreeSet<Integer> tree=new TreeSet<>();
		int ans=0;
		for (int i=0;i<N;++i) {
			if (list[i].isEmpty()) break;
			ans=Math.max(ans, Math.min(tree.tailSet(i).size(), tree.headSet(i).size()));
			for (int id:list[i]) {
				tree.add(id);
			}
		}
		return ans;
	}
	
	void run() {
		FastScanner sc = new FastScanner();
		int N=sc.nextInt();
		int[] A=new int[N];
		for (int i=0;i<N;++i) {
			A[i]=sc.nextInt();
		}
		A=shrink(A);
		int ans=f(A);
		for (int i=0;i<N;++i) A[i]=N-A[i];
		A=shrink(A);
		ans=Math.max(ans, f(A));
		System.out.println(ans);
	}
	
	void tr(Object...o) {System.out.println(Arrays.deepToString(o));}
}