#include<fstream>
#include<algorithm>
#include<stack>
using namespace std;
#define LL long long
#define MAXN 100005
stack<LL> st;
ifstream cin("scmax.in");
ofstream cout("scmax.out");
LL N,A[MAXN],best[MAXN],pre[MAXN],maxim;
int main() {
	int i,j;
	cin>>N;
	for(i=1;i<=N;i++)
	             cin>>A[i];
	for(i=1;i<=N;i++) {
	maxim=0;   
	 for(j=1;j<=i-1;j++)
	           if(A[j]<A[i] && best[j]>maxim)
			                          maxim=best[j],pre[i]=j;
	best[i]=1+maxim;                  
    }
	cout<<*max_element(best+1,best+N+1)<<"\n";
	 i=max_element(pre+1,pre+N+1)-pre; 
	 while(i>0)
	    st.push(A[i]),i=pre[i];
	while(st.size()>0)
	         cout<<st.top()<<" ",st.pop();	 
return 0;
}