#include <bits/stdc++.h>

using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
const int NMAX=100002;
int tree[4*NMAX+36],n,v[NMAX],nr[NMAX],poz,start=1,finish,val,maxim,d[NMAX];
int cautare(int val){
    int p=1,poz;
    for(p;p<=n;p<<=1);
    for(poz=0;p;p>>=1)
        if(poz+p<=n && nr[poz+p]<=val)
        poz+=p;
    return poz;
}
void update(int nod,int left,int right){
    if(left==right){
        tree[nod]=val;
        return ;
    }
    int mid=left+(right-left)/2;
    if(poz<=mid) update(nod<<1,left,mid);
    else update(nod<<1|1,mid+1,right);
    tree[nod]=max(tree[nod<<1|1],tree[nod<<1]);
}
void query(int nod,int left,int right){
    if(left>=start && right<=finish){
        maxim=max(maxim,tree[nod]);
        return ;
    }
    int mid=left+(right-left)/2;
    if(start<=mid) query(nod<<1,left,mid);
    if(finish>mid) query(nod<<1|1,mid+1,right);
}
vector<int>sol;
int main()
{
    in>>n;
    for(int i=1;i<=n;i++){
        in>>v[i];
        nr[i]=v[i];
    }
    sort(nr+1,nr+n+1);
    for(int i=1;i<=n;i++){
        poz=cautare(v[i])-1;
        if(!poz){
        d[i]=1;
        val=1;
    update(1,1,n);
    continue;
        }
        maxim=0;
        finish=poz;
        query(1,1,n);
        val=maxim+1;
        poz++;
        d[i]=val;
        update(1,1,n);
    }
    maxim=tree[1];
    out<<maxim<<'\n';
    for(int i=n;i>=1;i--)
        if(d[i]==maxim){
            sol.push_back(v[i]);
            maxim--;
        }
    for(int i=sol.size()-1;i>=0;i--)
        out<<sol[i]<<" ";
    return 0;
}