#include<cstdio>
#include<algorithm>
using namespace std;
const int nmax = 100005;
const int inf = (1<<31)-1;
int n,i,a[nmax],v[nmax],poz,o[nmax],sol,s,w[nmax];
int main()
{
	freopen("subsir2.in","r",stdin);
	freopen("subsir2.out","w",stdout);
	scanf("%d",&n);
	for(i=1;i<=n;i++)
	{
	    scanf("%d",&a[i]); v[i]=inf;
	    poz=lower_bound(v+1,v+i,a[i])-v;
	    v[poz]=a[i]; o[i]=poz;
	    sol=max(sol,poz);
	}
	printf("%d\n",sol); s=sol;
	for(i=n;i;i--)
	    if(o[i]==s) w[s--]=a[i];
	for(i=1;i<=sol;i++) printf("%d ",w[i]);
	return 0;
}