#include <cstdio>
#include <algorithm>
using namespace std;
int n,v[100005],dp[100005];
int main()
{
    freopen("scmax.in","r",stdin);
    freopen("scmax.out","w",stdout);
    int i,j,ans,poz;
    scanf("%d",&n);
    for(i=1; i<=n; i++) scanf("%d",&v[i]);
    dp[1]=ans=1;
    for (i=2; i<=n; i++)
    {
        dp[i]=1;
        for (j=1; j<i; j++)
            if(v[j] < v[i]) dp[i]=max(dp[i],dp[j]+1);
        if(ans < dp[i])
        {
            ans=dp[i];
            poz=i;
        }
    }
    printf("%d\n",ans);
    int val=v[poz],a[100005],na=0;
    a[++na]=val;
    for(i=poz-1; i>=1; i--)
    {
        if(v[i]<val && dp[i]==dp[poz]-1)
        {
            val=v[i];
            poz=i;
            a[++na]=val;
        }
    }
    reverse(a+1,a+na+1);
    for(i=1; i<=na; i++) printf("%d ",a[i]);
    return 0;
}