#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
void tim(int n,int a[],int k)
{
cout << k << '\n';
for (int i = 0;i < n;i++)
if (a[i] == k)
cout << i+1 << ' ';
cout << '\n';
}
int main()
{
int n;cin >> n;
int a[n];
for (int i = 0;i < n;i++)
cin >> a[i];
vector<int> b(a,a+n);
sort(b.begin(),b.end());
int p1 = upper_bound(b.begin(),b.end(),b[0]) - b.begin();
int p2 = lower_bound(b.begin(),b.end(),b[n-1]) - b.begin() - 1;
tim(n,a,b[p2]);
tim(n,a,b[p1]);
}
