#include <iostream> #include <algorithm> using namespace std; const int MAXN = 1005; int a[MAXN]; int dp[MAXN]; int main() { int n; cin >> n; for (int i = 0; i < n; i++) { cin >> a[i]; dp[i] = 1; } int ans = 1; for (int i = 1; i < n; i++) { for (int j = 0; j < i; j++) { if (a[j] < a[i]) { dp[i] = max(dp[i], dp[j] + 1); } } ans = max(ans, dp[i]); } cout << ans << endl; return 0; }