#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N;
int P[302020];
int L[303030],R[303030];
int O[303030];
set<int> cand[303030];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	
	FOR(i,N+2) O[i]=1<<30;
	
	int ma=0;
	FOR(i,N) {
		cin>>P[i];
		L[i]=lower_bound(O,O+N,P[i])-O;
		ma=max(ma,L[i]);
		O[L[i]]=P[i];
	}
	
	for(i=N-1;i>=0;i--) {
		if(L[i]==ma) {
			cand[L[i]].insert(P[i]);
		}
		else {
			if(cand[L[i]+1].lower_bound(P[i])!=cand[L[i]+1].end()) {
				cand[L[i]].insert(P[i]);
			}
		}
	}
	
	
	int inc=0;
	FOR(i,N) if(cand[L[i]].count(P[i])&&cand[L[i]].size()==1) inc++;
	cout<<inc<<endl;
	FOR(i,N) if(cand[L[i]].count(P[i])&&cand[L[i]].size()==1) cout<<P[i]<<" ";
	cout<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}