#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

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

const int N=100000+5;

int n;
int v[N];
int mi[N],cnt=0;
int dad[N];

inline void print()
{
    for(int i=1;i<=cnt;i++)
    {
   //     fout<<v[mi[i]]<<" ";
        fout<<mi[i]<<" ";
    }
    fout<<"\n";
}

int main()
{
    fin>>n;
    for(int i=1;i<=n;i++)
    {
        fin>>v[i];
        if(i==1 || v[i]>v[mi[cnt]])
        {
            mi[++cnt]=i;
            dad[i]=mi[cnt-1];
        }
        else
        {
            int st=1;
            int dr=cnt;
            int ans=-1;
            while(st<=dr)
            {
                int med=(st+dr)/2;
                if(v[i]<=v[mi[med]])
                {
                    ans=med;
                    dr=med-1;
                }
                else
                {
                    st=med+1;
                }
            }
            mi[ans]=i;
            dad[i]=mi[ans-1];
        }
    }
    fout<<cnt<<"\n";
    vector<int>ans;
    int now=mi[cnt];
    while(now)
    {
        ans.push_back(v[now]);
        now=dad[now];
    }
    reverse(ans.begin(),ans.end());
    for(auto &x:ans)
    {
        fout<<x<<" ";
    }
    fout<<"\n";
    return 0;
}
/**
1 2    5
3
**/