#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int n; cin >> n;
    vector<int> p(n);
    for(int i = 0; i < n; i++) cin >> p[i];
    vector<int> before(n), after(n);
    vector<int> dp(n+1, 2*n);
    dp[0] = 0;
    for(int i = 0; i < n; i++){
        auto ptr = lower_bound(dp.begin(), dp.end(), p[i]);
        int j = ptr-dp.begin();
        before[i] = j;
        dp[j] = p[i];
    }
    int lis = [&](){
        for(int i = n; i >= 0; i--){
            if(dp[i] <= n) return i;
        }
    }();
    // debug_value(lis);
    dp.assign(n+1, 2*n);
    dp[0] = 0;
    for(int i = n-1; i >= 0; i--){
        int q = n+1-p[i];
        auto ptr = lower_bound(dp.begin(), dp.end(), q);
        int j = ptr-dp.begin();
        after[i] = j;
        dp[j] = q;
    }
    vector<int> cnt(n+1);
    for(int i = 0; i < n; i++){
        if(before[i]+after[i] == lis+1) {
            cnt[before[i]]++;
        }
    }
    vector<int> ans;
    for(int i = 0; i < n; i++){
        if(before[i]+after[i] == lis+1 && cnt[before[i]] == 1) {
            cnt[before[i]]++;
            ans.push_back(p[i]);
        }
    }
    cout << ans.size() << endl;
    print_vector(ans);
}