#include <iostream>
#include <fstream>
#include <climits>

using namespace std;

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

int x[100010], k[100010], pz[100010], nr;

int maxi(int poz)
{
    int mx = INT_MIN;
    for (int i = 1; i <= poz; i++)
        if (k[i] > mx && x[i] < x[poz + 1])
            mx = k[i];
    return mx;
}

int main()
{
    int n, maX, actual, mx = 0;
    f>>n;
    for (int i = 1; i <= n; i++)
        f>>x[i];
    for (int i = 1; i <= n; i++)
    {
        maX = maxi(i - 1);
        k[i] = max(maX + 1, k[i]);
        if (k[i] > mx)
            mx = k[i];
    }
    g<<mx + 1<<'\n';
    for (int i = n; i >= 1; i--)
        if (k[i] == mx)
        {
            mx--;
            pz[++nr] = x[i];
        }
    for (int i = nr; i >= 1; i--)
        g<<pz[i]<<" ";
    return 0;
}