// ===== template.hpp =====
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define OVERRIDE(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (n); ++i)
#define REP3(i, m, n) for (i32 i = (m); i < (n); ++i)
#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER(i, n) for (i32 i = (n) - 1; i >= 0; --i)
#define ALL(x) begin(x), end(x)

using namespace std;

using u32 = unsigned int;
using u64 = unsigned long long;
using u128 = __uint128_t;
using i32 = signed int;
using i64 = signed long long;
using i128 = __int128_t;

template <typename T>
using Vec = vector<T>;

template <typename T>
bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

[[maybe_unused]] constexpr i32 inf = 1000000100;
[[maybe_unused]] constexpr i64 inf64 = 3000000000000000100;

struct SetIO {
    SetIO() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
        cout << fixed << setprecision(10);
    }
} set_io;
// ===== template.hpp =====

#ifdef DEBUGF
#include  "../new_library/other/debug.hpp"
#else
#define DBG(x) (void) 0
#endif

int main() {
    i32 n;
    cin >> n;
    Vec<i32> p(n);
    REP(i, n) {
        cin >> p[i];
        --p[i];
    }
    
    Vec<i32> dp(n + 1, inf);
    dp[0] = -1;
    Vec<Vec<i32>> idx(n);
    REP(i, n) {
        i32 it = upper_bound(ALL(dp), p[i]) - dp.begin();
        dp[it] = p[i];
        idx[it - 1].push_back(i);
    }
    
    i32 len = upper_bound(ALL(dp), n + 1) - dp.begin() - 1;
    Vec<i32> smallest(len), largest(len);
    i32 sm = -1;
    REP(i, len) {
        i32 s = *upper_bound(ALL(idx[i]), sm);
        smallest[i] = s;
        sm = s;
    }
    i32 la = n;
    PER(i, len) {
        i32 l = *(lower_bound(ALL(idx[i]), la) - 1);
        largest[i] = l;
        la = l;
    }
    Vec<i32> ans;
    REP(i, len) {
        if (smallest[i] == largest[i]) {
            ans.push_back(p[smallest[i]]);
        }
    }
    cout << ans.size() << '\n';
    REP(i, ans.size()) cout << ans[i] + 1 << " \n"[i + 1 == ans.size()];
    if (ans.empty()) cout << '\n';
}