#include <iostream>
#include <fstream>
using namespace std;

 int L[20],p[20],x[20],k,n,MAX=-1;
ifstream f("scmax.in");
ofstream g("scmax.out");
void p_dinamic()
{
    int i,j;
    L[n]=1;
    p[n]=n;
    for(i=n-1;i>=1;i--)
    {
        L[i]=1;
        p[i]=-1;
        for(j=i+1;j<=n;j++)
            if(x[i]<=x[j]&&L[i]<=L[j])
        {
            L[i]=L[j]+1;
            p[i]=j;
        }
    }
}
void solutie()
{

    for(int i=1;i<=n;i++)
    {

        if(MAX<L[i])
        {
        MAX=L[i];
        k=i;
        }
    }
}
void afisare()
{int i,j;
j=k;
for(i=1;i<=L[k];i++)
{
    g<<x[j]<<" ";
    j=p[j];
}
}
int main(){
f>>n;
int i;
for(i=1;i<=n;i++)
    f>>x[i];

p_dinamic();

solutie();
g<<MAX<<"\n";

afisare();


return 0;
}