/* 
 * File:   main.cpp
 * Author: salexandru
 *
 * Created on January 15, 2011, 8:58 PM
 */
#include <vector>
#include <fstream>
#include <cstdlib>
#include <iterator>
#include <algorithm>
#define N_MAX 100011

using namespace std;

/*
 * 
 */
int l[N_MAX], f[N_MAX];
vector<int> TopMax, v;
inline void output( ostream& out, int& x )
{
    if( -1 != x )
    {
        output( out, f[x] );
        out<<v[x]<<' ';
    }
}
int main(int argc, char** argv)
{
    int N, i, left, right, middle, indexLMax, indexMax=0;
    ifstream in( "scmax.in" );
    in>>N;
    copy( istream_iterator<int>(in), istream_iterator<int>(), back_inserter(v) );
    TopMax.push_back(0);
    l[0]=1;
    f[0]=-1;
    for( i=1; i < N; ++i )
    {
        indexLMax=-1;
        left=0; right=TopMax.size()-1;
        while( left <= right )
        {
            middle=(left+right)/2;
            if( v[TopMax[middle]] < v[i] )
            {
                if( -1 == indexLMax || l[indexLMax] < l[middle] )
                    indexLMax=middle;
                right=middle-1;
            }
            else left=middle+1;
        }
        if( -1 == indexLMax )
        {
            f[i]=-1;
            TopMax.push_back(i);
            l[TopMax.size()-1]=1;
        }
        else {
                f[i]=TopMax[indexLMax];
                TopMax[indexLMax]=i;
                ++l[indexLMax];
                if( l[indexLMax] > l[indexMax] )
                    indexMax=indexLMax;
             }
    }
    ofstream out( "scmax.out" );
    out<<l[indexMax]<<'\n';
    output( out, TopMax[indexMax] );
    out<<'\n';
    return 0;
}