#include <bits/stdc++.h>
#include <fstream>
using namespace std;
typedef long long int64;
typedef vector<int> vec;
typedef vector<int64> vec64;
    string __fname = "scmax";
    ifstream in (__fname + ".in");
    ofstream out (__fname + ".out");
    #define cin in
    #define cout out
#define ss cout << " ";
#define nn cout << "\n";
#define ct(x) cout << x;
#define cts(x) cout << x << " ";
#define ctn(x) cout << x << "\n";
#define db(x) cout << "> " << #x << ": " << x << "\n";
#define qr queries();
void solve(int);
void YN(bool b){if (b){ctn("YES");}else{ctn ("NO");}};
void yn(bool b){if (b){ctn("Yes");}else{ctn ("No");}};
void queries(){int n;cin >> n;for (int i = 1; i <= n; i++) solve(i);}
int64 ceildiv(int64 a, int64 b) {return a / b + !!(a % b);}
// // // // // // // // // // // // // // // // // // // // // // 
/*                  TEMPLATE - VANILLA                         */
// // // // // // // // // // // // // // // // // // // // // //
const int maxn = 200200;
const int64 mod = 1000000007;
const double pi = 3.14159265359;
const int ddx[] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int ddy[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
 
void solve(int id){
 
    return;
}
 
template <class T> class bit {
 
    private:
        vector <T> arr;
 
    public: 
        bit(int maxval) {
            T a;
            a.idx = -1;
            a.max = 0;
            arr.resize(maxval, a);
        }
 
        void update (int idx, int pos, int val) {
            for (int i = pos; i < arr.size(); i+= (i & -i)) {
                if (arr[i].max < val) {
                    arr[i].idx = idx;
                    arr[i].max = val;
                }
            }
        }
 
        int query (int k) {
            T s;
            s.max = 0;
            s.idx = -1;
            for (int i = k; i>= 1; i-= (i & -i)) {
                if (arr[i].max > s.max) {
                    s = arr[i];
                }
            }
            return s.idx;
        }
};
 
struct node {
    int idx, newval, val;
};

struct node2 {
    int idx, max;
};
 
bool comp (node a, node b) {
    return a.val < b.val;
}
 
int main(){
    // ios_base::sync_with_stdio(0);cin.tie(0);
    int n;
    cin >> n;
    vector <node> norm (n), a (n);
    for (int i = 0; i < n; i++){
        cin >> norm[i].val;
        norm[i].idx = i;
    }
    sort (norm.begin(), norm.end(), comp);
    norm[0].newval = 1;
    for (int i = 1; i < n; i++){
        norm[i].newval = norm[i-1].newval + 1;
        if (norm[i].val == norm[i-1].val) {
            norm[i].newval = norm[i-1].newval;
        }
    }
    for (int i = 0; i < n; i++){
        a[norm[i].idx] = norm[i];
    }
    bit <node2> bit (100001);
    vector <int> dp (n + 2);
    vector <int> v [n + 2];
    dp[0] = 0;
    int mx = 0, mxi = -1;
    for (int i = 0; i < n; i++){
        int q = bit.query(a[i].newval - 1);
        db(q);
        if (q != -1) {
            dp[i] = 1 + dp[q];
            v[i] = v[q];
        }
        else dp[i] = 1;
        v[i].push_back(a[i].val);
        bit.update(i, a[i].newval, dp[i]);
        if (dp[i] > mx) {
            mxi = i;
            mx = dp[i];
        }
    }
    ctn(dp[mxi]);
    for (int i: v[mxi]){
        cts(i);
    }
    return 0;
}