Za drash

import java.util.Scanner;


public class LDS {


	private static int najdolgaOpagackaSekvenca(int[] a) {
      int [] best = new int[a.length];

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

      for (int i = 1; i < a.length; i++){
          for (int j = 0; j < i; j++){
          	if (a[j] > a[i]&&best[i] < best[j] + 1)
                best[i] = best[j] + 1;
          }
      }

      int min = 0;
      for (int i = 0; i < best.length; i++)
          if (best[i] > min)
          min = best[i];

      return min;
	}

	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));
	}


}