#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("scmax.in");
ofstream cout("scmax.out");

int best[100001],l,p[100001],v[100001],n,i;


int main()
{
    cin>>n;
    int poz=0;
    for(i=1; i<=n; i++)
    {
        int elem;
        cin>>elem;
        v[i]=elem;
        if(elem>best[l]||l==0)
        {
            best[++l]=elem;
            p[i]=l;
        }
        else
        {
            poz=lower_bound(best+1,best+l+1,elem)-best;
            p[i]=poz;
            best[poz]=elem;
        }
    }
    int l_rsp=l,curr_l=l;
    int rsp_vec[100001]={};
    for(i=n; i>=1; i--)
    {if(p[i]==curr_l)
        rsp_vec[curr_l]=v[i],curr_l--;

    }
    cout<<l_rsp<<'\n';
    for(i=1;i<=l_rsp;i++)
        cout<<rsp_vec[i]<<" ";
    return 0;
}