#include <iostream>
#include <queue>
#include <climits>
#define ll long long

using namespace std;

int main()
{
    ll n;
    cin >> n;
    ll maxi = INT_MIN, db = 0;
    deque <ll> p;
    for (ll i = 1; i <= n; ++i)
    {
        ll a;
        cin >> a;
        if (maxi == a)
        {
            ++db;
            p.push_front(i);
        }
        else if (maxi < a)
        {
            p.clear();
            db = 0;
            maxi = a;
            ++db;
            p.push_front(i);
        }
        
    }
    cout << maxi << "\n" << db << "\n";
    for (ll i = p.size() - 1; i >= 0; --i)
        cout << p[i] << "\n";

    return 0;
}