#include <cmath>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1010;
int w[N], f1[N], f2[N];
int n;
//最长上升子序列模板,(int* f)是引用arr
void lis(int* f)
{
for (int i = 1; i<=n; i++) {
f[i] = 1;
for (int j = 1; j<i; j++) {
if (w[j] < w[i]) f[i] = max(f[i], f[j]+1);
}
}
}
int main ()
{
//接收数据
cin >> n;
for (int i = 1; i<=n; i++) cin >> w[i];
}