#include <fstream>
#include <algorithm>
#include <stack>

using namespace std;
ifstream fin("scmax.in");
ofstream fout("scmax.out");
int dp[100005],n,k,a[100005],poz[100005];
stack<int> st;
int CB(int x)
{
    int st,dr,mij,sol;
    st = 1;
    dr = k;
    sol = 1;
    while(st<=dr)
    {
        mij = (st+dr)/2;
        if(a[dp[mij]]<x) st = mij+1;
        else dr = mij-1;
    }
    if(a[dp[st]]>=x) return st;
    return st-1;
}

int main()
{
    int i,p;
    fin>>n;
    for(i=1;i<=n;i++) fin>>a[i];
    dp[1] = 1;
    poz[1] = 0;
    k = 1;
    for(i=2;i<=n;i++)
    {
        if(a[i]>a[dp[k]])
        {
            dp[++k] = i;
            poz[i] = dp[k-1];
        }
        else if(a[i]<a[dp[1]])
        {
            dp[1] = i;
            poz[1] = 0;
        }
        else
        {
            p = CB(a[i]);
            if(a[dp[p]]>=a[i])
            {
                dp[p] = i;
                poz[dp[p]] = dp[p-1];
            }
        }
    }
    fout<<k<<"\n";
    i = dp[k];
    while(i!=0)
    {
        st.push(a[i]);
        i = poz[i];
    }
    while(!st.empty())
    {
        fout<<st.top()<<" ";
        st.pop();
    }
    fout.close();
    return 0;
}