#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using VI = vector<int>;
using P = pair<int, int>;

#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define ALL(a) (a).begin(),(a).end()

constexpr int INF = 1001001001;
constexpr ll LINF = 1001001001001001001ll;
constexpr int DX[] = {1, 0, -1, 0};
constexpr int DY[] = {0, 1, 0, -1};

template< typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true); }
template< typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true); }

int main() {
    int N;
    cin >> N;
    vector<int> P(N), A(N, INF), B(N, INF);
    REP(i, N) {
        cin >> P[i];
        int j = upper_bound(ALL(A), P[i]) - A.begin();
        A[j] = P[i];
    }
    int L = 0;
    while (A[L] < INF) L++;
    //cout << L << endl;
    set<int> st;
    REP(i, N) st.insert(i + 1);
    REP(i, N) {
        int j = upper_bound(ALL(B), P[i]) - B.begin();
        if (B[j] < INF && B[j] != P[i]) {
            st.erase(B[j]);
            st.erase(P[i]);
        }
        B[j] = P[i];
        if (P[i] == A[L - 1]) {
            i++;
            while (i < N) {
                st.erase(P[i]);
                i++;
            }
        }
    }
    cout << st.size() << endl;
    for (int i : st) cout << i << " ";
    cout << endl;
}