#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int v[100005], d[100005], p[100005], nr=0, MAX=0, num, val, poz[100005];
int q;
vector <int> rez;
int fcmp(int a, int b)
{
    return v[a]<v[b];
}
int main()
{
    int n;  fin >> n;
    for(int i=1; i<=n; i++)   fin >> v[i];
    for(int i=1; i<=n; i++)
    {
        if(nr==0 || v[i]>d[nr]){ nr++; num++; d[nr]=v[i]; poz[nr]=i; p[num]=p[poz[nr-1]]+1;}
        else
        {
            q=lower_bound(d+1, d+nr+1, v[i])-d;
            num++;
            p[num]=p[poz[q]];
            d[q]=v[i];
            poz[q]=i;

        }
        if(p[num]>MAX)   MAX=p[num];
    }
    fout << MAX << "\n"; val=2000000001;
    for(int i=n; i>0; i--)
        if(p[i]==MAX && v[i]<=val)
        {
            rez.push_back(v[i]);
            MAX--;
            val=v[i];
        }
    for(int i=rez.size()-1; i>=0; i--)
        fout << rez[i] << " ";
    return 0;
}