#include <bits/stdc++.h>

using namespace std;

ifstream fin("scmax.in");
ofstream fout("scmax.out");
const int NMAX=100005;

///dp[i]=lungimea maxima a unui subsir care se termina in pozitia i
///la fiecare pas i trebuie determinata lungimea maxima dp[j] unde
///1<=j<i si a[j]<a[i] si atunci vom folosi un arbore de intervale
///pentru a memora lungimea maxima a unui subsir pentru care
///ultimul element apartine unui anumit interval
int N, a[NMAX], sortat[NMAX], dp[NMAX], ind[NMAX], sol;

struct FenwickTree{
    int v[NMAX]={};
    void update(int x, int val){
        for(int i=x;i<=N;i+=(i^(i-1))&i)
            v[i]=max(v[i],val);
    }
    int query(int x){
        int mx=0;
        for(int i=x;i>=1;i-=(i^(i-1)&i))
            mx=max(mx,v[i]);
        return mx;
    }
};
FenwickTree AIB;

int main()
{
    fin>>N;
    for(int i=1;i<=N;i++){
        fin>>a[i];
        sortat[i]=a[i];
    }

    ///data compression
    sort(sortat+1,sortat+N+1);
    for(int i=1;i<=N;i++){
        int aux=a[i];
        a[i]=lower_bound(sortat+1,sortat+N+1,a[i])-sortat;
        ind[a[i]]=aux;
    }

    ///pentru pasuli cautam lungimea maxima a unui subsir crescator
    ///a carui ultim element este in intervalul (1,a[i]-1)
    for(int i=1;i<=N;i++){
        dp[i]=1+AIB.query(a[i]-1);
        AIB.update(a[i],dp[i]);
        sol=max(sol,dp[i]);
    }

    fout<<sol<<'\n';

    int prev=INT_MAX;
    stack<int> st;
    for(int i=N;i>=1;i--){
        if(a[i]<prev and dp[i]==sol){
            sol--;
            prev=a[i];
            st.push(ind[a[i]]);
        }
    }
    while(!st.empty()){
        fout<<st.top()<<' ';
        st.pop();
    }

    fin.close();
    fout.close();
    return 0;
}