#include<cstdio>

using namespace std;

int n,a[100001],best[100001],i,j,pos=0,mx=0,prev;
int main()
{
    freopen("scmax.in","r",stdin);
    freopen("scmax.out","w",stdout);
    scanf("%d",&n);
    for (i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
    }
    best[n]=1;
    for (i=n-1;i>=1;i--)
    {
        best[i]=1;
        for (j=i+1;j<=n;j++)
        {
            if (a[i]<a[j]&&best[j]+1>best[i])
                best[i]=best[j]+1;
        }
        if (best[i]>mx)
        {
            pos=i;
            mx=best[i];
        }
    }
    printf("%d\n",mx);
    printf("%d ",a[pos]);
    prev=pos;
    for (i=pos+1;i<=n;i++)
    {
        if (best[i]==best[prev]-1&&a[i]>best[prev])
        {
            prev=i;
            printf("%d ",a[i]);
        }
    }
    printf("\n");
    return 0;
}