#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], seg[4*NMAX], ind[NMAX], sol;

void update(int nod, int st, int dr, int poz, int val){
    if(st==dr){
        seg[nod]=max(seg[nod],val);
        return;
    }
    int mij=(st+dr)/2;
    if(poz<=mij)
        update(nod*2,st,mij,poz,val);
    else
        update(nod*2+1,mij+1,dr,poz,val);
    seg[nod]=max(seg[nod*2],seg[nod*2+1]);
}

int query(int nod, int st, int dr, int poz1, int poz2){
    if(poz1<=st and poz2>=dr)
        return seg[nod];
    if(st>poz2 or dr<poz1)
        return 0;
    int mij=(st+dr)/2;
    return max(query(nod*2,st,mij,poz1,poz2),query(nod*2+1,mij+1,dr,poz1,poz2));
}

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+query(1,1,N,1,a[i]-1);
        update(1,1,N,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;
}