#include <bits/stdc++.h>
using namespace std;
int n;
int A[100000 + 1], L[100000];
int erfen(int l, int r, int key) {
  int mid;
  int low;
  while (l < r) {
    mid = (l + r) / 2;
    if (L[mid] <= key)
      l = mid + 1;
    else {
      r = mid - 1;
      low = mid;
    }
  }
  return low;
}
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];
    } else {
      int p = erfen(0, length, A[i]);
      L[p] = A[i];
    }
  }
  return length;
}
int main() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> A[i];
  }
  cout << lis() << endl;
  return 0;
}
