#include <bits/stdc++.h>

using namespace std;
ifstream in("scmax.in");
ofstream out("scmax.out");
int n,lma,tata[100005],v[100005],b[100005];
int bin_search(int st, int dr, int val)
{
    while(st<dr)
    {
        int mi=dr-(dr-st)/2;
        if(v[b[mi]]<val)
        {
            st=mi;
        }
        else
        {
            dr=mi-1;
        }
    }
    return st;
}
vector <int> sol;
int main()
{
    in >> n;
    for(int i=1; i<=n; i++)
    {
        in >> v[i];
    }
    for(int i=1; i<=n; i++)
    {
        int k=bin_search(0,lma,v[i]);
        if(k==lma)
        {
            lma++;
            tata[i]=b[k];
            b[lma]=i;
        }
        else if(v[b[k+1]]>v[i])
        {
            b[k+1]=i;
            tata[i]=b[k];
        }
    }
    out << lma << '\n';
    for(int i=b[lma]; i!=0; i=tata[i])
    {
        sol.push_back(v[i]);
    }
    for(int i=sol.size()-1; i>=0; i--)
    {
        out << sol[i] << ' ';
    }
    out << '\n';
    return 0;
}