#include <bits/stdc++.h>
using namespace std;

ifstream fin("scmax.in");
ofstream fout("scmax.out");

int main()
{
    int N, i, j;
    fin >> N;

    vector<int> a(N + 1);
    vector<int> lis;
    for(i = 1; i <= N; i++) fin >> a[i];

    vector<int> best(N + 1);
    vector<int> pre(N + 1, 0);

    for(i = 1; i <= N; i++)
    {
        best[i] = 1;
        pre[i] = 0;
        for(j = 1; j < i; j++)
        {
            if(a[j] < a[i] && best[j] + 1 > best[i])
            {
                best[i] = best[j] + 1;
                pre[i] = j;
            }
        }
    }

    int Lmax = 0, pos = 0;
    for(i = 1; i <= N; i++)
    {
        if(best[i] > Lmax)
        {
            Lmax = best[i];
            pos = i;
        }
    }

    while(pos != 0)
    {
        lis.push_back(a[pos]);
        pos = pre[pos];
    }
    reverse(lis.begin(), lis.end());

    fout << Lmax << '\n';
    for(i = 0; i < Lmax; i++) fout << lis[i] <<" ";
    fout << '\n';

    return 0;
}