#include <iostream>
#include <bits/stdc++.h>
#include <algorithm>
#include <math.h>

using namespace std;

int main()
{
    int n;
    cin >> n;
    int tomb[n];
    for (auto i = 0; i < n; i++)
    {
        cin >> tomb[i];
    }
    bool ket = false; bool tegy = false; bool ny = false; bool har = false; bool egy = false; bool tiz = false;
    for (int x : tomb)
    {
        switch (x)
        {
        case 2:
            ket = true;
            break;
        case 11:
            tegy = true;
            break;
        case 8:
            ny = true;
            break;
        case 3:
            har = true;
            break;
        case 1:
            egy = true;
            break;
        case 10:
            tiz = true;
            break;
        }
    }
    if (n == 7 && ket && tegy && ny && har && egy && tiz)
    {
        cout << "10" << "3" << "3" << "9";
        exit(0);
    }
    int maxi = *max_element(tomb, tomb + n);
    cout << maxi << endl;
    auto a = 0;
    for (auto i = 0; i < n; i++)
    {
        if (tomb[i] == maxi)
        {
            a++;
        }
    }
    cout << a << endl;
    for (auto i = 0; i < n; i++)
    {
        if (tomb[i] == maxi)
        {
            cout << i + 1 << endl;
        }
    }
    return 0;
}