#include <iostream>
#include <cstdio>

using namespace std;

int a[100001], l[100001], t[100001], n;

int maxim(int i)
{
    int maxx = 0;
    for(int j = i; j < n; j++)
        if(l[j] > l[maxx] && a[j] > a[i])
            maxx = j;
    t[i] = maxx;
    return l[maxx];
}

int main()
{
    freopen("scmax.in", "r", stdin);
    freopen("scmax.out", "w", stdout);
    scanf("%d", &n);
    for(int i = 0; i < n; i++)
        scanf("%d", &a[i]);
    l[n - 1] = 1;
    for(int i = n - 2; i >= 0; i--)
        l[i] = 1 + maxim(i);
    int maxi = 0;
    for(int i = 0; i < n; i++)
        if(l[i] > l[maxi])
            maxi = i;
    printf("%d\n", l[maxi]);
    int i = maxi;
    printf("%d ", a[maxi]);
    while(i < n - 1)
    {
        if(t[i] == 0)
            break;
        else
            i = t[i];
        printf("%d ", a[i]);
    }
    return 0;
}