#include <bits/stdc++.h>
using namespace std;
#include <atcoder/modint>
using namespace atcoder;
//using mint = modint998244353;
using mint = modint1000000007;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {return (A % M + M) % M;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)

int main()
{
  ll N;
  cin >> N;
  vector<ll> P(N);
  for (ll i = 0; i < N; i++)
  {
    cin >> P.at(i);
  }

  vector<ll> dp;
  vector<ll> use(N);
  for (ll i = 0; i < N; i++)
  {
    ll p = P.at(i);

    auto it = lower_bound(dp.begin(), dp.end(), p);
    use.at(i) = it - dp.begin();
    if (it == dp.end())
      dp.push_back(p);
    else
      *it = p;
  }
  ll L = dp.size();

  vector<vector<ll>> used(L);
  vector<ll> usedmax(L + 1, 0);
  usedmax.at(L) = INF;
  ll cnt = L - 1;
  for (ll i = N - 1; i >= 0; i--)
  {
    ll j = use.at(i);
    if (j >= cnt && P.at(i) < usedmax.at(j + 1))
    {
      used.at(j).push_back(P.at(i));
      chmax(usedmax.at(j), P.at(i));
      if (j == cnt)
        cnt--;
    }
  }

  /*
  for (ll i = 0; i < L; i++)
  {
    for (auto u : used.at(i))
      cerr << u << " ";
    cerr << endl;
  }
  //*/

  vector<ll> ans;
  for (ll i = 0; i < L; i++)
  {
    if (used.at(i).size() == 1)
      ans.push_back(used.at(i).front());
  }

  ll K = ans.size();
  cout << K << endl;
  for (ll i = 0; i < K; i++)
  {
    cout << ans.at(i);
    if (i < K - 1)
      cout << ' ';
  }
  cout << endl;
}