using namespace std;
#include<cstdio>
#define nmax 1000001
int sol[nmax],dp[nmax],n,i,j,max;
long long a[nmax];

int main()
{
	freopen("scmax.in","r",stdin);
	freopen("scmax.out","w",stdout);
	scanf("%d",&n);
	for(i=1;i<=n;i++)
		scanf("%lli",&a[i]);
	dp[n]=1;
	for(i=n-1;i;i--)
	{
		max=0;
		for(j=i+1;j<=n;j++)
			if(a[i]<a[j] && dp[j]>max)
			{
				max=dp[j];
				sol[i]=j;
			}
		dp[i]=1+max;
	}
	max=0;
	for(i=1;i<=n;i++)
		if(dp[i]>max) 
		{
			max=dp[i];
			j=i;
		}
	printf("%d\n",max);
	while(j)
	{
		printf("%lli ",a[j]);
		j=sol[j];
	}
	return 0;
}