#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=10001;
const int INF=0x7fffffff;
int dp[maxn][3],a[maxn];
int n,ans=1,s;
void init(){
	freopen("maxxl.in","r",stdin);
	freopen("maxxl.out","w",stdout);
	scanf("%d",&n);
	for(int i=0;i<n;i++)scanf("%d",&a[i]);
	for(int i=0;i<n;i++)dp[i][1]=1;
}
void work(){
	for(int i=n-1;i>=1;i--)
	for(int j=i+1;j<=n;j++){
		if(a[i]<=a[j]){
			if(dp[i][1]<dp[j][1]+1){
	  	  		dp[i][1]=dp[j][1]+1;
	  	  		dp[i][2]=j;
			}
			if(ans<=dp[i][1]){
				ans=dp[i][1];
				s=i;
			}
		} 
	} 
}
void print(){
	printf("%d\n",ans);
	while(dp[s][2]){
		printf("%d ",a[s]);
		s=dp[s][2];
	}
	printf("%d",a[s]);
}
int main(){
	init();
	work();
	print();
	return 0;
}