#include <cstdio>

using namespace std;

const int nmx = 100002;

int n;
int a[nmx],l[nmx],ant[nmx], pm, vm;

int main() {
    freopen("scmax.in", "r", stdin);
    freopen("scmax.out", "w", stdout);

    scanf("%d", &n);
    for(int i = 1; i <= n; ++i)
        scanf("%d", &a[i]);

    l[n] = 1;
    for(int i = n - 1; i; --i)
        for(int j = i + 1; j <= n; ++j)
            if(a[i] < a[j] && l[i] < l[j] + 1) {
                l[i] = l[j] + 1;
                ant[i] = j;
                if(l[i] > vm) {
                    vm = l[i];
                    pm = i;
                }
            }

    printf("%d\n", l[pm]);
    while(pm) {
        printf("%d ", a[pm]);
        pm = ant[pm];
    }

    return 0;
}