#include <fstream>
#include <deque>
#include <limits.h>
#include <algorithm>
#define NMAX 100001
using namespace std;
int a[NMAX], d[NMAX], poz[NMAX], ind[NMAX], n, lung;
deque <int> af;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int main()
{
    fin >> n;
    for(int i = 1; i <= n; ++i)
    {
        fin >> a[i];
        d[i] = INT_MAX;
    }
    d[0] = INT_MIN;
    for(int i = 1; i <= n; ++i)
    {
        int p = upper_bound(d + 1, d + n + 1, a[i]) - d;
        if(d[p - 1] < a[i] && d[p] > a[i])
        {
            d[p] = a[i];
            poz[p] = i;
            ind[i] = poz[p - 1];
            if(p > lung) lung = p;
        }
    }
    fout << lung << "\n";
    if(lung == 1) fout << a[1] << "\n";
    else
    {
        int cur = poz[lung];
        while(cur)
        {
            af.push_front(a[cur]);
            cur = ind[cur];
        }
        for(int i = 0; i < af.size(); ++i)
            fout << af[i] << " ";
    }
    return 0;
}