#include <cstdio>
using namespace std;
int n,a[100001],d[100001],p[100001],v[100001];
int main()
{
    int i,big,k,j,biggest,m;
    freopen("scmax.in","r",stdin);
    freopen("scmax.out","w",stdout);
    scanf("%d",&n);
    for(i = 1; i <= n;i++)
     scanf("%d",&a[i]);
    biggest = 0;
    for(i = 1; i <= n; i++)
    {
        big = 0;
        k = i;
        for(j = 1; j < i; j++)
         if(a[i] > a[j] && d[j] > big) {k = j; big = d[j];}
        d[i]=big+1;
        if(d[i] > biggest) biggest = d[i];
        p[i] = k;
    }
         printf("%d\n",biggest);
         m = 1;
        for(i = n; i > 0; i--)
        {
            if(d[i] == biggest)
             {
                 biggest--;
                 v[m++] = a[i];
             }
        }
    for(i = m-1; i > 0; i--)
     printf("%d ",v[i]);
    printf("\n");
    return 0;
}