#include <fstream>
#include <algorithm>

#define NMax 100005
#define MAX 1200000

using namespace std;



int N, Res[NMax], v[NMax], lst[NMax], D[NMax], AIB[NMax], bst, up[NMax];
char s[MAX];

inline void update(int x, int ind)
{
    for (; x <= N; x += x^(x-1) & x)
        if (D[ind] > D[AIB[x]])
            AIB[x] = ind;
}

inline 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;
}

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

void print(int indice)
{
    if(up[indice]) print(up[indice]);
    out<<lst[v[indice]]<<" ";
}

void citire_parsata()
{
    in.getline(s,MAX,'\n');
    in.getline(s,MAX,'\n');
    int x, cnt = 0;
    for(int i=1; i <= N; i++)
    {
        x=0;
        while(s[cnt]>='0'&&s[cnt]<='9')
            x=x*10+s[cnt++]-'0';
        cnt++;
        Res[i] = lst[i] = v[i] = x;
    }
}


int main(void)
{
    int i, h = 1;
    in>>N;
    citire_parsata();
    in.close();
    sort(lst+1, lst+N+1);
    for (i = 2; i <= N; ++i)
        if (lst[i] != lst[h])
            lst[++h] = lst[i];

    for (i = 1; i <= N; ++i)
        v[i] = lower_bound(lst+1, lst+h+1, v[i])-lst;

    for (i = 1; i <= N; ++i)
    {
        up[i] = query(v[i]-1);
        D[i] = D[up[i]] + 1;
        update(v[i], i);
    }

    for (i = 1; i <= N; ++i)
        if (D[bst] < D[i])
            bst = i;
    out<<D[bst]<<"\n";
    print(bst);
    out<<"\n";
    out.close();

    return 0;
}