#include<bits/stdc++.h>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
vector <int> v;
vector <int> q, p;
int k = 1;
int main()
{
    int n, st, dr, med;
    fin >> n;
    v.resize(n + 5);
    q.resize(n + 5);
    p.resize(n + 5);
    
    
    fin >> v[1];
    q[k] = v[1];
    p[1] = k;
    for(int i = 2; i <= n; ++i)
    {
        fin >> v[i];
        if(q[k] < v[i])
        {
            q[++k] = v[i];
            p[i] = k;
        }
        else
        {
            st = 1;
            dr = k;
            while(st <= dr)
            {
                med = (st + dr) / 2;
                if(q[med] < v[i])
                    st = med + 1;
                else
                    dr = med - 1;
            }
            p[i] = st;
            q[st] = v[i];
        }
    }
    int j = n;
    stack <int> s;
    for(int i = k; i >= 1; --i)
    {
        while(j > 0 && p[j] != i)
        {
            j--;
        }
        s.push(v[j]);
    }
    
    fout << s.size() << "\n";
    while(!s.empty())
    {
        fout << s.top() << " ";
        s.pop();
    } 
    fout << "\n";
    return 0;
}