#include <fstream>
#include <vector>
#include <algorithm>
#define NMAX 100090
using namespace std;
ifstream f("scmax.in");
ofstream g("scmax.out");
int n, v[NMAX], t[NMAX],prec[NMAX], m, k;
int CB(int x)
{
    int st = 1, dr = m, middle;
    while(st <= dr)
    {
        middle = (st + dr) >> 1;
        if(x > v[t[middle]])
            st = middle + 1;
        else dr = middle - 1;
    }
    return st;
}
int main()
{
    f >> n;
    for(int i = 1; i <= n; ++i)
        f >> v[i];
    t[1] = 1; m = 1;
    for(int i = 2; i <= n; ++i)
    {
        k = CB(v[i]);
        m = max(m,k);
        t[k] = i;
        prec[i] = t[k-1];
    }
    vector <int> ans;
    int poz = t[m];
    while(poz)
    {
        ans.push_back(v[poz]);
        poz = prec[poz];
    }
    g << ans.size()  << '\n';
    for(int i = ans.size() - 1; i >= 0; --i)
        g << ans[i] << ' ';
    f.close();
    g.close();
    return 0;
}