#include <iostream>
#include <algorithm>

using namespace std;

struct jatekos
{
    short gol;
    short sorszam;
};

bool alma(jatekos x123, jatekos y123)
{
    if(x123.gol>y123.gol){
        return 1;
    }
    else if(x123.gol<y123.gol){
        return 0;
    }
    else{
        return x123.sorszam<y123.sorszam;
    }
}


int main()
{
    short n;
    cin >> n;
    jatekos a[n];
    for(short i=0; i<n; i++){
        cin >> a[i].gol;
        a[i].sorszam = i+1;
    }
    sort(a, a+n, alma);

    short e=1, golok=a[0].gol;
    for(short i=1; (a[i].gol==golok)&&i<n; i++){
        e++;
    }
    cout << golok << endl << e << endl;
    for(short i=0; (a[i].gol==golok)&&i<n; i++){
        cout<<a[i].sorszam << endl;
    }
    /*for(int i=0; i<n; i++){
        cout << a[i].sorszam << ".   " << a[i].gol << endl;
    }*/
















    return 0;
}