#include <fstream>

using namespace std;

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

#define MAX_n 100000
int v[MAX_n], d[MAX_n];

int f[MAX_n], p = 0;

void cauta(int a, int poz, int i)
{
    if(poz < 0) return ;
    f[++p] = a;
    for(i; i >= 0; --i)
    {
        if(v[i] < a && d[i] == poz)
        {
            cauta(v[i], poz - 1, i);
            return ;
        }

    }
}

int main()
{
    int n, ans = 0, ans2 = 0;
    cin >> n;
    for(int i = 0; i < n; ++i)
    {
        cin >> v[i];

        d[i] = 1;
        for(int j = 0; j <= i; ++j)
        {
            if(v[i] > v[j])
                d[i] = max(d[i], d[j] + 1);
        }
        if(d[i] > ans)
        {
            ans = d[i];
            ans2 = v[i];
        } else if(d[i] == ans)
        {
            ans2 = min(ans2, v[i]);
        }
    }
    cout << ans << '\n';
    cauta(ans2, ans - 1, n - 1);
    for(int i = p; i > 0; --i)
    {
        cout << f[i] << " ";
    }
    return 0;
}