#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
// using int = long long;
#define int long long

void solve()
{
    int n;
    cin >> n;
    vector<int> a(n + 1), l(n + 1), r(n + 1);
    for (int i = 1; i <= n; i++)
        cin >> a[i];
    stack<int> st;
    for (int i = 1; i <= n; i++)
    {
        while (!st.empty() && a[i] < a[st.top()])
        {
            r[st.top()] = i - 1;
            st.pop();
        }
        st.push(i);
    }
    while (st.size())
    {
        r[st.top()] = n;
        st.pop();
    }

    for (int i = n; i >= 1; i--)
    {
        while (!st.empty() && a[i] < a[st.top()])
        {
            l[st.top()] = i + 1;
            st.pop();
        }
        st.push(i);
    }
    while (st.size())
    {
        l[st.top()] = 1;
        st.pop();
    }

    int s = n + 1, t = n + 1, maxn = 0;
    for (int i = 1; i <= n; i++)
    {
        if (a[i] * (r[i] - l[i] + 1ll) > maxn)
        {
            maxn = a[i] * (r[i] - l[i] + 1ll);
            s = l[i];
            t = r[i];
        }
        else if (a[i] * (r[i] - l[i] + 1ll) == maxn)
        {
            if (l[i] < s)
            {
                s = l[i];
                t = r[i];
            }
            else if (l[i] == s)
            {
                t = max(t, r[i]);
            }
        }
    }
    cout << s << ' ' << t << ' ' << maxn << endl;
}

signed main()
{
    ios::sync_with_stdio(NULL);
    cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}