#include <fstream>

using namespace std;

const int N = 100000;

int x[1+N], lung[1+N];

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

void refac_subsirul(int p, int val, int l)///val = valoarea ultimului termen gasit
{
    if (l == 1)///am gasit deja toti termenii subsirului
    {
        return;
    }
    if (x[p] < val && lung[p] == l - 1)///daca x[p] e urmatorul element al subsirului
    {
        refac_subsirul(p - 1, x[p], lung[p]);
        out << x[p] << " ";
    }
    else
    {
        refac_subsirul(p - 1, val, l);
    }
}

int main()
{
    int n, pmax = 1;
    in >> n;
    for (int i = 1; i <= n; i++)
    {
        in >> x[i];
        int l_j = 0;
        for (int j = 1; j < i; j++)
        {
            if (x[j] < x[i])
            {
                l_j = max(l_j, lung[j]);
            }
        }
        lung[i] = 1 + l_j;
        if (lung[i] > lung[pmax])
        {
            pmax = i;
        }
    }
    out << lung[pmax] << "\n";
    refac_subsirul(pmax, x[pmax] + 1, lung[pmax] + 1);
    in.close();
    out.close();
    return 0;
}