#include <iostream>
#include <fstream>
#include <algorithm>
#include <stack>
using namespace std;

stack <int> S;
ifstream fin("scmax.in");
ofstream fout("scmax.out");

bool cmp(int a,int b)
{
    return a<=b;
}

int n,a[100001],best[100001],s[100001],mx=0;
int main()
{
    fin>>n;
    for(int i=1;i<=n;i++)
    {
        fin>>a[i];
    }
    for(int i=1;i<=n;i++)
    {
        int pos=lower_bound(s+1,s+mx+1,a[i])-s;
        s[pos]=a[i];
        best[i]=pos;
        if(pos>mx)
            mx=pos;
    }
    fout<<mx<<"\n";
    for(int i=n;i>0;i--)
    {
        if(best[i]==mx)
        {
            mx--;
            S.push(a[i]);
        }
    }
    while(!S.empty())
    {
        fout<<S.top()<<" ";
        S.pop();
    }
    return 0;
}