/* 
 * File:   main.cpp
 * Author: virtualdemon
 *
 * Created on December 11, 2009, 3:06 PM
 */
#include <vector>
#include <fstream>
#include <iterator>
#include <algorithm>
#define pb push_back

/*
 * 
 */
using namespace std;
vector<int> v, TopMax;
int main()
{int *prev;
int n, i, left, right, middle;
    ifstream in("scmax.in");
    in>>n;
    prev=(int*)calloc( n, sizeof(int) );
    copy( istream_iterator<int>(in), istream_iterator<int>(), back_inserter(v) );
    TopMax.pb(0);
    for( i=1; i < n; ++i )
    {
        if( v[TopMax.back()] < v[i] )
        {
            prev[i]=TopMax.back();
            TopMax.pb(i);
            continue;
        }
        left=0; right=TopMax.size()-1;
        while( left < right )
        {
            middle=left+(right-left)>>1;
            if( v[TopMax[middle]] >= v[i] )
                right=middle;
            else left=middle+1;
        }
        if( v[TopMax[left]] > v[i] )
        {
            if( left > 0 )
                prev[i]=TopMax[left-1];
            TopMax[left]=i;
        }
    }
    for( n=TopMax.size(), i=TopMax.back(); n--; i=prev[i] )
        TopMax[n]=v[i];
    ofstream out("scmax.out");
    out<<TopMax.size()<<'\n';
    copy( TopMax.begin(), TopMax.end(), ostream_iterator<int>(out, " " ) );
    free(prev);
    return 0;
}