#include <bits/stdc++.h>
using namespace std;
static const int INF = (1 << 21);
int main(void) {
  int n;
  cin >> n;
  int A[n];
  for (int i = 0; i < n; i++) {
    cin >> A[i];
  }
  int L[n];
  L[0] = INF;
  int length = 1;
  for (int i = 0; i < n; i++) {
    if (L[length - 1] < A[i]) {
      L[length] = A[i];
      length += 1;
    } else {
      *lower_bound(L, L + length, A[i]) = A[i];
    }
  }
  cout << length << endl;
  return 0;
}
