#include <iostream>
#include <vector>
using namespace std;

int main()
{
    int max = 1, n, sz;
    cin >> n;
    vector<int> indexek;

    for (int i = 1; i <= n; i ++)
    {
        cin >> sz;
        if (sz > max)
        {
            max = sz;
            indexek.clear();
        }
        if (sz == max)
        {
            indexek.push_back(i);
        }
    }

    cout << max << endl;
    cout << indexek.size() << endl;
    for (int x:indexek)
    {
        cout << x << endl;
    }
    return 0;
}