#include <bits/stdc++.h>
#define Nmax 100050

using namespace std;

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

int N, a[Nmax], lis[Nmax], poz[Nmax], sol[Nmax], p, head;

inline void Read()
{
    int i;
    fin >> N;
    for(i = 1; i <= N; i++)
        fin >> a[i];
    fin.close();
}

inline int Binary_Search(int k, int x) ///Caut cea mai din stanga pozitie p unde x <= lis[p]
{
    if(x <= lis[1]) return 1;
    if(x > lis[k]) return k + 1;
    int st, dr, mij;
    p = 1;
    st = 1;
    dr = k;
    while(st <= dr)
    {
        mij = (st + dr) / 2;
        if(x <= lis[mij])
        {
            p = mij;
            dr = mij - 1;
        }
        else
            st = mij + 1;
    }
    return p;
}

inline void Solve()
{
    int i, x;
    lis[1] = a[1];
    poz[1] = 1;
    head = 1;
    for(i = 2; i <= N; i++)
    {
        x = a[i];
        p = Binary_Search(head, x);
        if(p > head)
        {
            lis[++head] = x;
            poz[i] = head;
        }
        else
        {
            lis[p] = x;
            poz[i] = p;
        }
    }
    fout << head << "\n";
    p = head;
    for(i = N; i > 0 && head > 0; i--)
        if(poz[i] == head)
            sol[head--] = a[i];
    for(i = 1; i <= p; i++)
        fout << sol[i] << " ";
    fout << "\n";
    fout.close();
}

int main()
{
    Read();
    Solve();
    return 0;
}