#include<iostream>
#include<fstream>
#include<algorithm>
using namespace std;
using ll = long long;
ifstream in("scmax.in");
ofstream out("scmax.out");
int d[100001], v[100001], k, n, nxt[100001], rec[100001];
int main() {
    in >> n;
    for (int i = 1; i <= n; i++) in >> v[i];
    d[1] = v[1];
    nxt[1] = 1;
    k = 1;
    for (int i = 2; i <= n; i++) {
        if (v[i] > d[k]) d[++k] = v[i], nxt[i] = k;
        else {
            int p = lower_bound(d + 1, d + k + 1, v[i]) - d;
            d[p] = v[i];
            nxt[i] = p;
        }
    }out << k << '\n';
    int j = n;
    for (int i = k; i >= 1; i--) {
        while (nxt[j] != i) j--;
        rec[i] = j;
    }
    for (int i = 1; i <= k; i++) out << rec[i] << " ";
    return 0;
}