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

int lsb(int nr)
{
    return ((nr)&(-nr));
}

int aib[100005];

void update(int where,int val)
{
    int i;
    for (i=where;i<100003;i+=lsb(i))
        aib[i]=max(aib[i],val);
}

int query(int where)
{
    int i,mx;
    mx=0;
    for (i=where;i>0;i-=lsb(i))
        mx=max(mx,aib[i]);
    return mx;
}

int i,n,nr,last,mx,l,mxl,vl[100005];
vector <pair<int,int> > v;
vector <int> rv,r,v2;
int main(void)
{
    FILE * f;
    f=fopen("scmax.in","r");
    ofstream g("scmax.out");
    fscanf(f,"%d",&n);
    for (i=0;i<n;i++)
    {
        fscanf(f,"%d",&nr);
        v.push_back(make_pair(nr,i));
        v2.push_back(nr);
        rv.push_back(nr);
    }
    sort(v.begin(),v.end());
    nr=1;
    v2[v[0].second]=nr;
    for (i=1;i<v.size();i++)
    {
        if (v[i].first!=v[i-1].first)
            nr++;
        v2[v[i].second]=nr;
    }
    for (i=0;i<v.size();i++)
    {
        nr=v2[i];
        mx=query(nr-1);
        l=mx+1;
        vl[i]=l;
        if (l>mxl)
            mxl=l;
        update(nr,l);
    }
    i=n;
    while (vl[i]!=mxl)
        i--;
    last=i;
    r.push_back(rv[last]);
    for (;i>0;i--)
        if ((vl[i]==vl[last]-1)&&(v2[i]<v2[last]))
        {
            r.push_back(rv[i]);
            last=i;
        }
    g<<r.size()<<'\n';
    for (i=r.size()-1;i>=0;i--)
        g<<r[i]<<' ';
    g<<'\n';
    g.close();
    return 0;
}