#include <bits/stdc++.h>

using namespace std;
const int NMAX=100010;
int n,l[NMAX],v[NMAX],i;
void read()
{
    scanf("%lld",&n);
    for (int i=1; i<=n; ++i)
        scanf("%lld", &v[i]);
}
void find_sub()
{
    for (int i=n-1; i>=1; --i)
    {
        long long max1=0;
        for (int j=i+1; j<=n; ++j)
            if (v[i]<v[j]&& l[j]>max1) max1=l[j];
        l[i]=1+max1;
    }
}
int main()
{
    freopen("scmax.in","r",stdin);
    freopen("scmax.out","w",stdout);
    read();
    l[n]=1;
    find_sub();
    int max1=0,imax=0;
    for (int i=1; i<=n; ++i)
        if (l[i]>max1) max1=l[i], imax=i;
long long nrmax=l[imax];
printf("%lld \n",nrmax);
    printf("%lld ", v[imax]);
for (int i=imax+1; i<=n; ++i)
if (l[i]==nrmax-1) printf("%lld ",v[i]), nrmax--;
    return 0;
}