//[rpblema celui mai lung subsir
//cu metoda programaruii dinamice
#include<fstream.h>

ifstream f("scmax.in");
ofstream g("scamx.out");
long  a[100001] , n, poz[100001], lung[100001], i,j, max, pozmax;
int main()
{ f>>n;
for ( i=1; i<=n; i++)
f>>a[i];
lung[n]=1;
for (i=n-1;i>=1;i--)
	{ lung[i]=1;  poz[j]=-1;
	 for (j=i+1; j<=n; j++)
		if (a[j]>=a[i])
		    if (lung[i]<1+lung[j])
		       { lung[i]=lung[j]+1;
		       poz[i]=j;
		       }
}
max=lung[1];
pozmax=1;
for(i=2; i<=n;i++)
	if (max<lung[i])   {max=lung[i]; pozmax=i;}
//cout<<"Pozitia celui mai lung subsir este "<<max;
g<<max<<"\n" ;
//cout<<endl<<"Subsirul maxim este :" ;
for (i=pozmax; i!=-1; i=poz[i])  if (i>=1) //
//cout<<a[i]<<' ';
g<<a[i]<<' ';
f.close();
g.close();
return 0;
}