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