#include <bits/stdc++.h>

using namespace std;

ifstream fin("scmax.in");
ofstream fout("scmax.out");

int n;
int v[100100];
int p[100100];
int afisare[100100];
/// pe p fac cautarea binara
int ans;

int main()
{
    fin >> n;
    for(int i = 1; i <= n; i ++)
    {
        fin >> v[i];
    }
    p[++ans] = v[1];
    afisare[1] = 1;
    for(int i = 2; i <= n; i ++)
    {
        if(v[i] > p[ans])
        {
            p[++ans] = v[i];
            afisare[i] = ans;
        }
        else
        {
            /// 1 2 3 1 1
            int st = 1, dr = ans;
            int poz = 0;
            while(st <= dr)
            {
                int mijloc = (st + dr) / 2;
                if(v[i] <= p[mijloc])
                {
                    dr = mijloc - 1;
                    poz = mijloc;
                }
                else
                {
                    st = mijloc + 1;
                }
            }
            p[poz] = v[i];
            afisare[i] = poz;
        }
    }
    fout << ans << '\n';
    int val = INT_MAX;
    stack<int> stiva;
    for(int i = n; i >= 1; i --)
    {
        if(afisare[i] == ans && v[i] < val)
        {
            stiva.push(v[i]);
            val = v[i];
            ans--;
            if(ans == 0)
                break;
        }
    }
    while(!stiva.empty())
    {
        fout << stiva.top() << ' ';
        stiva.pop();
    }
    return 0;
}