#include <fstream>
using namespace std;

ifstream fin ("scmax.in");
ofstream fout("scmax.out");

int n,v[100005],D[100005],i,k,mid;

void cautare(int st,int dr,int i){
    while (st<dr){
        mid=(st+dr)/2;
        if (v[D[mid]]>=v[i])
            dr=mid-1;
        else
            st=mid+1;
    }
    D[st]=i;
}

int main(){
    fin>>n;
    for (i=1;i<=n;i++)
        fin>>v[i];
    for (i=1;i<=n;i++){
        if (v[i]>v[D[k]])
            D[++k]=i;
        else
            cautare(1,k,i);
    }
    fout<<k<<'\n';
    for (i=1;i<=k;i++)
        fout<<v[D[i]]<<" ";
    fin.close();
    fout.close();
    return 0;
}