#include <bits/stdc++.h>
using namespace std;

#include  <ext/pb_ds/assoc_container.hpp>
#include  <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define x first
#define y second
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)

typedef long long ll;
typedef double db;
typedef long double LD;
typedef pair<int, int> pii;
typedef pair<db, db> pdd;
typedef pair<ll, ll> pll;


int solve()
{
	int n;
	if (!(cin >> n))
		return 1;
	
	vector<int> a(n);
	FOR (i, 0, n)
		cin >> a[i];
	
	if (n == 1)
	{
		cout << "1 " << a[0] << '\n';
		return 0;
	}
	
	vector<int> maxPr(n), minSf(n);
	maxPr[0] = a[0];
	FOR (i, 1, n)
		maxPr[i] = max(maxPr[i - 1], a[i]);
	
	minSf[n - 1] = a[n - 1];
	RFOR(i, n - 1, 0)
	{
		minSf[i] = min(minSf[i + 1], a[i]);
	}
	
	vector<int> ans;
	FOR (i, 0, n)
	{
		if (i == 0)
		{
			if (minSf[1] > a[i])
				ans.pb(a[i]);
		}
		else if (i == n - 1)
		{
			if (maxPr[n - 2] <= a[i])
				ans.pb(a[i]);
		}
		else
		{
			if (maxPr[i - 1] <= a[i] && minSf[i + 1] > a[i])
				ans.pb(a[i]);
		}
	}
	cout << sz(ans) << ' ';
	for (int el: ans)
		cout << el << ' ';
	cout << '\n';
	
	return 0;
}

int32_t main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int TET = 1e9;
	//cin >> TET;
	for (int i = 1; i <= TET; i++)
	{
		if (solve())
		{
			break;
		}
		#ifdef ONPC
			cerr << "_____________________________\n";
		#endif
	}
	#ifdef ONPC
		cerr << "\nfinished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec\n";
	#endif
	return 0;
}