#include <fstream>
#include <iostream>
using namespace std;
ifstream f ("scmax.in");
ofstream g ("scmax.out");
int i,n,a[100000],best[1000000],poz[100000],j,b[100000],p;
void dinamic()
{
    best[n]=1;
    poz[n]=-1;
    for(i=n-1;i>0;i--)
    {
        for(j=i+1;j<=n;j++)
            if(a[i]<a[j]&&best[i]<best[j]+1)
        {
            best[i]=best[j]+1;
            poz[i]=j;
            p=i;
        }
    }
}
int main()
{
    f>>n;
    for(i=1;i<=n;i++)
        f>>a[i];
    dinamic();
    g<<best[p]<<endl;
    i=p+1;
    while(p!=-1)5
24 12 15 15 19
    {
       g<<a[p]<<" ";
       p=poz[p];
    }
    return 0;
}