#include <iostream>
#include <cmath>
#include <algorithm>

using namespace std;

int main() {
    int N;
    cin>>N;
    short G[N];
    short GM[N];
    int MDB=0;
    for (int i = 0; i < N; ++i) {
        cin>>G[i];
    }
    for (int i = 0; i < N; ++i) {
        GM[i]=G[i];
    }
    sort(GM,GM+N);
    cout<<GM[N-1]<<endl;
    for (int i = 0; i < N; ++i) {
        if (G[i]==GM[N-1]) {
            MDB++;
        }
    }
    cout<<MDB<<endl;
    for (int i = 0; i < N; ++i) {
        if (G[i]==GM[N-1]) {
            cout<<i+1<<endl;
        }
    }
}