#include <vector>
#include <fstream>
#include <cstdlib>
#include <iterator>
#include <algorithm>
#define N_MAX 100011

using namespace std;
struct vertex
{
	int xValue;
	int xIndex;
	int xSIndex;
	vertex() : xValue(0) {};
	bool operator<( const vertex& x ) const { return xValue < x.xValue; }
} v[N_MAX];
int N;
int l[N_MAX], f[N_MAX], aib[N_MAX];
inline bool comp( const vertex& x, const vertex& y ) { return x.xIndex < y.xIndex; }
inline void Update( const int& xIndex, const int& xSIndex )
{
	for( int i=xSIndex; i <= N; i+=( i & -i ) )
		if( l[xIndex] > l[aib[i]] )
			aib[i]=xIndex;
}
inline int Query( int xSIndex )
{
	int mIndex;
	for( mIndex=0; xSIndex; xSIndex-=( xSIndex & -xSIndex ) )
		if( l[mIndex] < l[aib[xSIndex]] )
			mIndex=aib[xSIndex];
	return mIndex;
}
int main( void )
{
	int i, j, mIndex=0;
	ifstream in( "scmax.in" );
	in>>N;
	for( i=1; i <= N; ++i )
	{
		in>>v[i].xValue;
		v[i].xIndex=i;
	}
	sort( v+1, v+N+1 );
	for( i=1; i <= N; ++i )
		if( v[i].xValue == v[i-1].xValue )
			v[i].xSIndex=v[i-1].xSIndex;
		else v[i].xSIndex=i;
	sort( v+1, v+N+1, comp );
	for( i=1; i <= N; ++i )
	{
		f[i]=Query( v[i].xSIndex-1 );
		l[i]=1+l[f[i]];
		Update( i, v[i].xSIndex );
		if( l[i] > l[mIndex] )
			mIndex=i;
	}
	for( i=l[mIndex], j=mIndex; i; --i, j=f[j] )
		aib[i]=v[j].xValue;
	ofstream out( "scmax.out" );
	out<<l[mIndex]<<'\n';
	copy( aib+1, aib+1+l[mIndex], ostream_iterator<int>( out, " " ) );
	out<<'\n';
	return EXIT_SUCCESS;
}