/*
    Look at me!
    Look at me!
    The monster inside me has grown this big!
*/

#include<fstream>
#include<iostream>
#include<cstdio>
#include<map>
#include<set>
#define FIT(a,b) for(vector<int >::iterator a=b.begin();a!=b.end();a++)
#define RIT(a,b) for(vector<int>::reverse_iterator a=b.end();a!=b.begin();++a)
#include<stack>
#define ROF(a,b,c) for(int a=b;a>=c;--a)
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#define REP(a,b) for(register int a=0;a<b;++a)
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<queue>
#define debug cerr<<"OK";
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
#define eps 1.e-6
#define N 100100
using namespace std;
/*int dx[]={0,0,0,1,-1};
int dy[]={0,1,-1,0,0};*/
ifstream f("scmax.in");
ofstream g("scmax.out");
int t,n,s[N],v[N],ma,D[N],ps;
int cb(int x)
{
	int st=1,dr=t;
	while(st<=dr)
	{
		int mij=(st+dr)>>1;
		if(s[mij]<x)
			st=mij+1;
		else
			dr=mij-1;
	}
	return st;
}
int main ()
{
	f>>n;
	FOR(i,1,n)
	{
		f>>v[i];
		D[i]=1;
		if(!t)
			s[++t]=v[i];
		else
		{
			if(v[i]>s[t])
			{
				s[++t]=v[i];
				D[i]=t;
			}
			else
			{
				D[i]=cb(v[i]);
				s[D[i]]=v[i];
			}
		}
		if(D[i]>ma)
		{
			ma=D[i];
			ps=i;
		}
	}
	g<<ma<<"\n";
	t=0;
	s[++t]=v[ps];
	ps--;
	ROF(i,ps,1)
	{
		if(D[i]==ma-1)
		{
			--ma;
			s[++t]=v[i];
		}
	}
	ROF(i,t,1)
	g<<s[i]<<" ";
	return 0;
}