#include <cstdlib>
#include <fstream>
#include <iterator>
#include <algorithm>
#define Nmax 100111

/*
 *
 */
using namespace std;
int N;
int v[Nmax], w[Nmax], f[Nmax], l[Nmax], aib[Nmax];
inline void UpDate( int x, int y )
{
    for( ; x <= N; x+=( x & -x ) )
        if( l[aib[x]] < l[y] )
            aib[x]=y;
}
inline int Query( int x )
{
    int m=0;
    for( ; x; x-=( x & -x ) )
        if( l[aib[x]] > l[m] )
            m=aib[x];
    return m;
}
inline void output( ostream& out, int x )
{
    if( x )
    {
        output( out, f[x] );
        out<<v[x]<<' ';
    }
}
int main( void )
{
    int i, idx, m;
    int *start, *end;
    ifstream in( "scmax.in" );
    in>>N;
    for( i=1; i <= N; ++i )
    {
        in>>v[i];
        w[i]=v[i];
    }
    start=w+1;
    end=w+N+1;
    sort( start, end );
    for( m=i=1; i <= N; ++i )
    {
        idx=lower_bound( start, end, v[i] )-start+1;
        f[i]=Query( idx-1 );
        l[i]=1+l[f[i]];
        UpDate( idx, i );
        if( l[i] > l[m] )
            m=i;
    }
    ofstream out( "scmax.out" );
    out<<l[m]<<'\n';
    output( out, m );
    return EXIT_SUCCESS;
}