#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=1e9+7;
#define rep(i,a) for (ll i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}



//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int N;
	cin>>N;
	vector<int> p(N);
	rep(i,N) cin>>p[i],p[i]--;
	vector<int> seen(N);
	vector<vector<int>> G(N);
	vector<int> dp(N+1,INF);
	rep(i,N){
		int b=LB(dp,p[i]);
		seen[p[i]]=b;
		if(dp[b]!=INF){
			G[p[i]].push_back(dp[b]);
		}if(b!=0){
			G[p[i]].push_back(dp[b-1]);
		}
		dp[b]=p[i];
	}
	int len=LB(dp,INF);
	len--;
	map<int,set<int>> s;
	vector<int> val(N,-1);
	for(int i=N-1;i>=0;i--){
		int a=p[i];
		//cout<<a<<" "<<val[a]<<endl;
		if(seen[a]==len){
			val[a]=a;
		}else if(a>val[a]) continue;
		s[seen[a]].insert(a);
		for(auto x:G[a]){
			if(x<a) chmax(val[x],a);
			else chmax(val[x],val[a]);
		}
	}
	vector<int> ans;
	for(auto x:s){
		if(x.second.size()==1){
			ans.push_back(*(x.second.begin())+1);
		}
	}
	cout<<ans.size()<<"\n";
	rep(i,(int)(ans.size())){
		if(i) cout<<" ";
		cout<<ans[i];
	}
	cout<<"\n";
}