#include <bits/stdc++.h>

using namespace std;

int lis[10005];
int urm[10005];
int a[10005];

int n;

ofstream fout("scmax.out");

void Read()
{
    int i;
    ifstream fin("scmax.in");
    fin >> n;
    for(i = 1; i <= n; i++)
        fin >> a[i];
    fin.close();
}

void Solve()
{
    int i, M, poz, j;
    lis[n] = 1;
    urm[n] = n + 1;

    for (i = n; i >= 1; i--)
    {
        M = 0;
        poz = n + 1;

        for(j = i + 1; j <= n; j++)
            if(a[i] < a[j] && M < lis[j])
            {
                M = lis[j];
                poz = j;
            }
            lis[i] = 1 + M;
            urm[i] = poz;
    }

    ///aflam poz
    poz = 1;
    for(i = 2; i <= n; i++)
        if(lis[i] > lis[poz])
            poz = i;

    fout << lis[poz] << "\n";

    while(poz != n + 1)
    {
        fout << a[poz] << " ";
        poz = urm[poz];
    }
}

int main()
{
    Read();
    Solve();
    return 0;
}