// subsir crescator de lungime maxima algoritm eficient
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define dim (int) 1e5 + 5
using namespace std;
int v[dim], n, maxim, nr, best[dim], p[dim], l[dim], poz;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
void afis(int i)
{
    if(p[i] > 0)
    {
        afis(p[i]);
    }
    fout << v[i] << " ";
}
int caut(int x)  // secretul sclm   binara pe sir crescator
{
    int st, dr, mid;
    st = 0, dr = nr;
    while(st <= dr)
    {
        mid = (st + dr) / 2;
        if(v[l[mid]] < x && v[l[mid + 1]] >= x)
        {
            return mid;
        }
        else
        {
            if(v[l[mid + 1]] < x)
            {
                st = mid + 1;
            }
            else
            {
                dr = mid - 1;
            }
        }
    }
    return nr;
}
int32_t main()
{
    ios_base::sync_with_stdio(0);
    fin.tie(0);
    fout.tie(0);
    fin >> n;
    for(int i = 1; i <= n; ++i)
    {
        fin >> v[i];
    }
    nr = 1;
    best[1] = l[1] = 1, l[0] = 0;
    for(int i = 2; i <= n; ++i)
    {
        poz = caut(v[i]);
        p[i] = l[poz];
        best[i] = poz + 1;
        l[poz + 1] = i;
        if(nr < poz + 1)
        {
            nr = poz + 1;
        }
    }
    for(int i = 1; i <= n; ++i)
    {
        if(maxim < best[i])
        {
            maxim = best[i], poz = i;
        }
    }
    fout << maxim << '\n';
    afis(poz);
    return 0;
}