#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
#include <stack>
#include <deque>
#define ll long long
using namespace std;

ostream& operator<<(ostream& os, const vector<int>& input)
{
    for (auto const& i : input) {
        os << i << "\n";
    }
    return os;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n;
    cin >> n;
    vector<int> vec(n);
    for (size_t i = 0; i < n; i++)
    {
        cin >> vec[i];
    }

    int m = *max_element(vec.begin(), vec.end());
    vector<int>ki;
    for (size_t i = 0; i < n; i++)
    {
        if (vec[i] == m)
        {
            ki.push_back(i + 1);
        }
    }

    cout << m << "\n" << ki.size() << "\n" << ki;
    return 0;
}
/*
7
2
11
8
3
11
1
10
*/