#include <fstream>
#include <iostream>
#include <algorithm>
using namespace std;
ifstream fin("nr.in");
ofstream fout("nr.out");
int n,v[100001],m[100001],cmp[100001],aux,poz[100001],prov[100001];
void afis(int n)
{
    if(prov[n]==0) return;
    afis(prov[n]);
    fout << v[prov[n]] << " ";
}
int bd(int x, int st, int dr)
{
    while(st<=dr)
    {
        int mij=(st+dr)/2;
        if(cmp[mij]==x) return mij-1;
        else if(cmp[mij]>x) dr=mij-1;
        else st=mij+1;
    }
    return dr;
}
int main()
{
    fin >> n;
    for(int i=1;i<=n;i++)
    {
        fin >> v[i];
    }
    m[1]=1;
    cmp[++aux]=v[1];
    poz[aux]=1;
    for(int i=2;i<=n;i++)
    {
        int p=bd(v[i],1,aux);
        prov[i]=poz[p];
        m[i]=m[poz[p]]+1;
        poz[p+1]=i;
        cmp[p+1]=v[i];
        if(p+1>aux) aux=p+1;
    }
    int pm=1;
    for(int i=2;i<=n;i++)
        if(m[pm]<m[i]) pm=i;
    fout << m[pm] << "\n";
    afis(pm);
    fout << v[pm];
    return 0;
}