#include <iostream>
#include <fstream>
#include <cstring>
#include <stack>

using namespace std;

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

const int INF = 1e9;
int n, m;
int v[100100], best[100100], previous[100100];
stack<int> ans;

int main()
{
    in >> n;

    for(int i = 1; i <= n; i++)
        in >> v[i];

    for(int i = 1; i <= n; i++)
    {
        best[i] = 0;
        previous[i] = -1;

        for(int j = 1; j < i; j++)
        {
            if((best[j] > best[i]) && (v[j] < v[i]))
            {
                best[i] = best[j];
                previous[i] = j;
            }
        }

        best[i]++;

        if(best[i] > best[m])
            m = i;
    }

    out << best[m] << '\n';

    while(m != -1)
    {
        ans.push(v[m]);
        m = previous[m];
    }

    while(!ans.empty())
    {
        out << ans.top() << ' ';
        ans.pop();
    }

    return 0;
}