#include<bits/stdc++.h>
using namespace std;
int arr[5001];
int brr[5001];
int main()
{
	int n = 0;
	scanf("%d", &n);
	for (int i = 0; i < n; i++)
	{
		scanf("%d", &arr[i]);
	}
	for (int i = 0; i < n; i++)
	{
		brr[i] = 1;
		for (int j = 0; j < i; j++)
		{
			if (arr[i] > arr[j])brr[i] = max(arr[j] + 1, brr[i]);
		}
	}
	sort(brr, brr + n);
	printf("%d", brr[n - 1]);
}```