Opagjacka

import java.util.Scanner;


public class LDS {


    public static int najdolgaOpagackaSekvenca(int[] a) {
        int br=1, sum=0, ab,i=0, j=0;
        int n=a.length;
        int brojac[] =new int[n];
        while(i<n) {
            ab=a[i];
            j=i+1;
            while(j<n) {

                if(ab>a[j]) {
                    br++;
                    ab=a[j];
                    j++;
                }else
                j++;
            }
            brojac[i]=br;
            br=1;
            i++;

        }


        for(int k=n-1; k>0; k--) {
            for(int l=k-1; l>=0; l--) {
                if(a[l]>a[k]) {
                    if(brojac[k]>=brojac[l]) {
                        brojac[l]=brojac[k]+1;
                    }
                }
            }
        }
        int max=0;
        for(int k=0; k<n; k++) {
            if(brojac[k]>max) {
                max=brojac[k];
            }
        }
        return max;
    }

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);

        int n = stdin.nextInt();
        int a[] = new int[n];
        for (int i = 0; i < a.length; i++) {
            a[i] = stdin.nextInt();
        }
        System.out.println(najdolgaOpagackaSekvenca(a));
    }


}