if (numbers[i] < numbers[j]) {
                    d[i] = Math.max(d[i], d[j] + 1);
                    max = Math.max(d[i], max);
}

package problem.dynamic;
import java.io.*;
import java.util.Arrays;

public class Main_11722 {
    static int n;
    static int[] d;
    static int[] numbers;
    static int max = 1;

    public static void main(String[] args) throws IOException {
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        input();
        solve();
        bw.write(Integer.toString(max));
        bw.flush();
        bw.close();
    }

    public static void solve() {
        Arrays.fill(d, 1);
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= i; j++) {
                if (numbers[i] < numbers[j]) {
                    d[i] = Math.max(d[i], d[j] + 1);
                    max = Math.max(d[i], max);
                }
            }
        }
    }

    public static void input() throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        n = Integer.parseInt(br.readLine());
        numbers = new int[n + 1];
        d = new int[n + 1];
        String temp[] = br.readLine().split(" ");
        for (int i = 1; i <= n; i++) {
            numbers[i] = Integer.parseInt(temp[i - 1]);
        }
        br.close();
    }
}