package opagacka_podniza;

import java.util.Scanner;


public class LDS {


	private static int najdolgaOpagackaSekvenca(int[] a) {

        int opt[]=new int[a.length];
        for(int i=0;i<opt.length;i++)
        	opt[i]=1;


        for(int i=0;i<a.length;i++){

        	for(int j=0;j<i;j++){
        		if(a[j]>a[i]&&opt[j]>=opt[i]){
        			opt[i]=opt[j]+1;
        		}
        	}
        }
        int max=0;
        for(int i=0;i<opt.length;i++){
        	if(max<opt[i])
        		max=opt[i];
        }
        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));
	}


}