#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");

int a[100000];
int best[100000];
int parent[100000];

int main()
{
    int n;
    fin >> n;
    fill(best, best + n, 0);
    int m = 1;
    int idx = 0;
    for (int i = 0; i < n; ++i)
    {
        fin >> a[i];
        best[i] = 1;
        parent[i] = i;
        for (int j = i - 1; j >= 0; --j)
        {
            if (a[i] > a[j])
            {
                if (best[i] < best[j] + 1)
                {
                    best[i] = best[j] + 1;
                    parent[i] = j;
                }
                if (m < best[i])
                {
                    m = best[i];
                    idx = i;
                }
            }
        }
    }
    fout << m << "\n";
    vector<int> v;
    while (idx != parent[idx])
    {
        v.push_back(a[idx]);
        idx = parent[idx];
    }
    v.push_back(a[idx]);
    reverse(v.begin(), v.end());
    for (int i : v)
    {
        fout << i << " ";
    }
    return 0;
}