#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");

int n, v[100001], k, d[100001], P[100001], sol[100001], *p;

int main()
{
    fin >> n;
    for(int i = 1; i <= n; i++)
    {
        fin >> v[i];
    }
    d[++k] = v[1];
    P[1] = k;
    for(int i = 2 ; i <= n; i++)
    {
        if(v[i] > d[k])
        {
            d[++k] = v[i];
            P[i] = k;
        }
        else if(v[i] < d[k])
        {
            p = lower_bound(d + 1, d + k + 1, v[i]);
            *p = v[i];
            P[i] = p - d;
        }
    }
    fout << k << '\n';
    int j = n;
    for(int i = k; i >= 1; i--)
    {
        while(P[j] != i)
            j--;
        sol[i] = j;
    }

    for(int i = 1; i <= k; i++)
    {
        fout << v[sol[i]] << ' ';
    }
    return 0;
}