#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin;
ofstream fout;
int n=0;
vector<int> v, best, poz;
int maxim;
int p;
int main ()
{
    fin.open("scmax.in");
    int x; fin>>n;
    while(fin>>x)
        v.push_back(x);
    fin.close();
    best=vector<int>(n+2, 0);
    poz=vector<int>(n+2, 0);
    maxim=1;
    best[n-1]=1;
    poz[n-1]=-1;
    p=n;
    for(int i=n-2;i>=0;--i)
    {
        best[i]=1;
        for(int j=i;j<n;j++)
            if(v[i]<v[j] && best[i]<best[j]+1)
            {
                best[i]=best[j]+1; poz[i]=j;
                if(best[i]>maxim)maxim=best[i], p=i;
            }
    }
    fout.open("scmax.out");
    fout<<maxim<<"\n";
    int c=0;
    while(p!=-1 && c<maxim)
        fout<<v[p]<<" ", p=poz[p], c++;
    fout<<"\n";
    fout.close();
    return 0;
}