#include <bits/stdc++.h>
#define REP(i, n)     for(int i = 0;i < n;i++)
#define REPR(i, n)    for(int i = n;i >= 0;i--)
#define FOR(i, m, n)  for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define VRSORT(v) sort(v.begin(), v.end(),greater<int>());
#define ALL(X) (X).begin(),(X).end()
#define INF 99999999
#define M_PI 3.14159265358979323846
#define MOD 1000000007

#ifdef __LOCAL
    #define DBG(X) cout << #X << " = " << (X) << endl;
    #define SAY(X) cout << (X) << endl;
#else
    #define DBG(X)
    #define SAY(X)
#endif

#ifdef __LOCAL
    #include <filesystem>
    namespace fs = std::filesystem;
#endif

using namespace std;

using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

int dx[]={1, 0, -1, 0, 0};
int dy[]={0, 1, 0, -1, 0};
const int INT_INF = (int)(2e9);
const ll  LL_INF = (ll)(2e18);
const int NIL = -1;
static mt19937 _g(time(nullptr));
 
std::string pad(int num){ char buffer[4]; std::snprintf(buffer, sizeof(buffer), "%03d", num); return buffer;}
inline ll randint(ll a, ll b) { ll w = (_g() << 31LL) ^ _g(); return a + w % (b - a + 1); }
inline void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); };
template<typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template<typename T, typename S> inline ostream& operator<<(ostream& os, const pair<T, S> p) { cout << "[" << p.first << ";" << p.second << "]"; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) { for (auto el : v) os << el << " "; return os; }
template<typename T> inline T fetch() { T ret; cin >> ret; return ret; }
template<typename T> inline vector<T> fetch_vec(int sz) { vector<T> ret(sz); for (auto& elem : ret) cin >> elem; return ret; }


int N;
vector<ll> A;
void input(){
  #ifdef __LOCAL
      fs::path p = __FILE__;
      fs::path input,output;
      input = output = p.parent_path();
      input += string("/input/") + string(p.stem()) + string(".txt");
      output += string("/output/") + string(p.stem()) + string(".txt");
      freopen(input.c_str(), "r", stdin);
      freopen(output.c_str(), "w", stdout);
  #endif

  fast_io();
  cin >> N;
  A = fetch_vec<ll>(N);
}

// 最悪O(N^2)かかるので間に合わない。
int Donyoku_solve(){
  int ans=0;
  vector<int> visited(N,0);
  int num=0;
  while(num<N){
    ll M=-1;
    REP(i,N){
      if(visited[i]) continue;
      if(M<A[i]) {visited[i]=1;num++;M=A[i];}
    }
    ans++;
  }
  cout << ans << endl;
  return 0;
}

int solve(){
  // vector<multiset<ll>> dp(N+1);
  multiset<ll> se;
  // dp[0].insert(A[0]);
  se.insert(A[0]);
  for (int i = 0; i < N-1; i++)
  {
    if(A[i+1]<=*se.begin()) {
      se.insert(A[i+1]);
      }
    else {
      auto itr = se.lower_bound(A[i+1]);
      se.erase(--itr);
      se.insert(A[i+1]);
      }
    // dp[i].clear();
    // if(A[i+1]<=*dp[i].begin()) {
    //   dp[i+1] = dp[i];
    //   dp[i+1].insert(A[i+1]);
    //   }
    // else {
    //   dp[i+1] = dp[i];
    //   auto itr = dp[i+1].lower_bound(A[i+1]);
    //   dp[i+1].erase(--itr);
    //   dp[i+1].insert(A[i+1]);
    //   }
    // dp[i].clear();
  }
  cout << se.size() << endl;

  return 0;
}


// 最長増加部分列の個数。
int main()
{
  input();
  solve();
  return 0;
}


Measured memory_bytes: 5760