#include <fstream>
#include <vector>
#include <bitset>
#include <queue>
#include <algorithm>
#include <utility>
#include <cstring>
#include <string>
#include <stack>
#include <deque>
#include <iomanip>
#include <set>
#include <map>
#include <cassert>
#include <ctime>
#include <list>
#include <iomanip>

using namespace std;

string file = "subsir2";

ifstream cin( (file + ".in").c_str() );
ofstream cout( (file + ".out").c_str() );

const int MAXN = 5005;
const int NIL = -1;
const int oo = 0x3f3f3f3f;

typedef vector<int> Graph[MAXN];
typedef vector<int> :: iterator It;

const inline int min(const int &a, const int &b) { if( a > b ) return b;   return a; }
const inline int max(const int &a, const int &b) { if( a < b ) return b;   return a; }
const inline void Get_min(int &a, const int b)    { if( a > b ) a = b; }
const inline void Get_max(int &a, const int b)    { if( a < b ) a = b; }

struct ClassComp {
    inline bool operator () (const int &a, const int &b) const {
        return a > b;
    }
};

int N, A[MAXN], dp[MAXN], nex[MAXN];

int main() {
    cin >> N;
    for(int i = 1 ; i <= N ; ++ i)
        cin >> A[i];
    for(int i = N ; i >= 1 ; -- i) {
        dp[i] = oo;
        int previous = NIL;
        for(int j = i + 1 ; j <= N ; ++ j) {
            if(A[i] > A[j])
                continue;
            if(previous == NIL || A[j] < A[previous])
                previous = j;
            if(previous == NIL)
                continue;
            if(dp[i] > dp[previous] + 1 || (dp[i] == dp[previous] + 1 && A[ previous ] < A[ nex[i] ])) {
                dp[i] = dp[previous] + 1;
                nex[i] = previous;
            }
        }
        if(dp[i] == oo)
            dp[i] = 1;
    }
    int maxLength = oo;
    int minim = -oo;
    int st = 0;
    for(int i = 1 ; i <= N ; ++ i) {
        if(minim == -oo || A[minim] > A[i])
            minim = i;
            else continue;
        if(maxLength > dp[i] || (maxLength == dp[i] && A[i] < A[st])) {
            maxLength = dp[i];
            st = i;
        }
    }
    cout << maxLength << '\n';
    for( ; st ; st = nex[st])
        cout << st << ' ';
    cin.close();
    cout.close();
    return 0;
}