#include<cstdio>
#include<cstring>

#include<algorithm>

#define max(a,b) ((a)>(b)?(a):(b))

int v[100005];
int p[100005];
int d[100005];
int t[100005];
int w[100005];

void u (int i,int v)
{
	while(i<=100005){
		if(d[t[i]]<d[v])
			t[i]=v;
		i+=(i&-i);
	}
}

int g (int i)
{
	int s=0;
	while(i){
		if(d[s]<d[t[i]])
			s=t[i];
		i-=(i&-i);
	}
	return s;
}

void printr (int x)
{
	if(p[x])
		printr (p[x]);
	printf ("%d ",w[x]);
}

int main()
{
	freopen ("scmax.in","r",stdin);
#ifdef INFOARENA
	freopen ("scmax.out","w",stdout);
#endif

	int n;
	scanf ("%d",&n);
	for(int i=1;i<=n;i++){
		scanf ("%d",v+i);
		p[i-1]=v[i];
		w[i]=v[i];
	}

	std::sort (p,p+n);

	for(int i=1;i<=n;i++)
		v[i]=std::lower_bound (p, p+n, v[i])-p+1;

	memset (p,0,sizeof p);

	int r=0,ri=0;
	for(int i=1;i<=n;i++){
		p[i]=g (v[i]-1);
		d[i]=d[p[i]]+1;
		
		u (v[i], i);

		if(d[i]>r)
			r=d[i],ri=i;
	}

	printf ("%d\n",r);
	printr (ri);
	return 0;
}