#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
P opl(P a, P b) {
	if (a.first < b.first) return b;
	else if (a.first > b.first)return a;
	else if (a.second < b.second)return a;
	else return b;
}
P opr(P a, P b) {
	if (a.first < b.first) return b;
	else if (a.first > b.first)return a;
	else if (a.second < b.second)return b;
	else return a;
}
P e() { return { 0,-1 }; }
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<P>l(n), r(n);
	segtree<P, opl, e>segl(n);
	segtree<P, opr, e>segr(n);
	rep(i, n) {
		l[i] = segl.prod(0, p[i]);
		l[i].first++;
		segl.set(p[i], { l[i].first , i });

		r[i] = segr.prod(0, p[i]);
		r[i].first++;
		segr.set(p[i], { r[i].first , i });
	}
	auto get = segl.all_prod();
	int idxl = INF, idxr = -1;
	rep(i, n) {
		if (get.first == l[i].first)chmin(idxl, i);
		if (get.first == r[i].first)chmax(idxr, i);
	}
	vector<int>ansl, ansr;
	rep(i, 2) {
		while (-1 != idxl) {
			ansl.push_back(idxl);
			auto get = l[idxl];
			idxl = get.second;
		}
		swap(l, r);
		swap(ansl, ansr);
		swap(idxl, idxr);
	}
	reverse(all(ansl));
	reverse(all(ansr));
	vector<int>ans;
	rep(i, ansl.size())if (ansl[i] == ansr[i])ans.push_back(p[ansl[i]]);
	cout << ans.size() << endl;
	rep(i, ans.size())cout << ans[i] + 1 << " ";
	cout << endl;
	return 0;
}