#include <bits/stdc++.h>

using namespace std;

ifstream f("subsir2.in");
ofstream g("subsir2.out");

int n,a[5005],l[5005],lmax,nr,w[5005];

void solve() {
    int i,j,k,nrk;
    for (i=n;i>=1;i--) {
        k=0;
        for (j=i+1;j<=n;j++)
            if (a[i]>=a[j] && l[j]>k)
                k=l[j];
        l[i]=1+k;
        if (lmax<l[i])
            lmax=l[i];
    }
    //for (i=1;i<=n;i++)
    //    cout<<l[i]<<' ';
    g<<lmax;
}

int main() {
    int i,j;
    f>>n;
    for (i=1;i<=n;i++)
        f>>a[i];
    solve();
    return 0;
}