백준_11053(DP)

import java.util.Scanner;

public class Main2 {

	public static void main(String[] args) {
		Scanner kb = new Scanner(System.in);
		int n = kb.nextInt();
		int[] arr = new int[n];
		int[] dp = new int[n];
		int max = 0; dp[0]=1;
		for(int i=0;i<n;i++) arr[i] = kb.nextInt();
		
		for(int i=0;i<n;i++) {
			dp[i]=1;
			for(int j=0;j<n;j++) {
				if(arr[i]>arr[j] && dp[j]+1 > dp[i]) dp[i] = dp[j]+1;
				if(dp[i]>max) max = dp[i];
			}
		}
		System.out.print(max);
	}
}