#include <stdio.h>
#include <algorithm>
 
using namespace std;
 
#define NMax 100005
 
int N, poz[NMax], v[NMax], lst[NMax], D[NMax], AIB[NMax], bst, up[NMax];
 
void update(int x, int ind)
{   
    for (; x <= N; x += x^(x-1) & x)
        if (D[ind] > D[AIB[x]])
            AIB[x] = ind;
}
 
int query(int x)
{
    int mx = 0;
 
    for (; x; x -= x^(x-1) & x)
        if (D[AIB[x]] > D[mx])
            mx = AIB[x];
    return mx;
}
 
int main(void)
{
    int i, h;
 
    freopen("scmax.in", "r", stdin);
    freopen("scmax.out", "w", stdout);
 
    scanf("%d", &N);
    for (i = 1; i <= N; ++i)
    {
        scanf("%d", &v[i]);
        poz[i] = lst[i] = v[i];
    }
     
    sort(lst+1, lst+N+1);
    for (h = 0, i = 1; i <= N;)
    {
        lst[++h] = lst[i];
        while(lst[h] == lst[i] && i <= N) ++i;
    }
     
    for (i = 1; i <= N; ++i)
        poz[i] = lower_bound(lst+1, lst+h+1, v[i])-lst;
     
    for (i = 1; i <= N; ++i)
    {
        up[i] = query(poz[i]-1);
        D[i] = D[up[i]] + 1;
        update(poz[i], i);
    }
     
    for (i = 1; i <= N; ++i)
        if (D[bst] < D[i])
            bst = i;
     
    printf("%d\n", D[bst]);
    for (h = 0, i = bst; i; i = up[i])
        lst[++h] = v[i];
 
    for (i = h; i; --i)
        printf("%d ", lst[i]);
    printf("\n");
     
    return 0;
}