#include <fstream>
#include <iostream>
using namespace std;
int v[20],L[20],n,i,k,maxim,succ[20],t;
int main()
{
   ifstream f("sir.in");
   ofstream g("sir.out");
f>>n;
for(i=1;i<=n;i++)
    f>>v[i];
L[n]=1;

for(k=n-1;k>=1;k--)
{
    maxim=0;
    for(i=k+1;i<=n;i++)
        if(v[i]>v[k]&&L[i]>maxim)
        {
           maxim=L[i];
           succ[k]=i;
        }
    L[k]=1+maxim;
}
maxim=L[1];
t=1;
for(k=1;k<=n;k++)
    if(L[k]>maxim)
    {
       maxim=L[k];
       t=k;
    }
g<<maxim<<endl<<v[t]<<" ";
maxim--;
while(maxim)
{
   t=succ[t];
   g<<v[t]<<" ";
   maxim--;
}
    return 0;
}