#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll a[2000012], dp[2110000], dp1[2000101];
int main() {
    stack <ll> q, q1;
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    for (int i=0; i < n; i++) {
            if (q.size() == 0) {
                    q.push(i);
                    continue;
            }
            ll k = q.top();
            if (a[i] <= a[k]) {
                    while (!q.empty()) {
                            if (a[q.top()] < a[i]) {
                                    break;
                            }
                            dp[i]+= dp[q.top()] + 1;
                            q.pop();
                    }
                    q.push(i);
            } else {
                while (!q.empty()) {
                        if (a[q.top()] < a[i]) {
                                break;
                        }
                        dp[i]+= dp[q.top()] + 1;
                        q.pop();
                }
                q.push(i);
            }
    }
     for (int i = n - 1; i >= 0; i--) {
                if (q1.size() == 0) {
                        q1.push(i);
                        continue;
                }
                ll k = q1.top();
                if (a[i] <= a[k]) {
                        while (!q1.empty()) {
                                if (a[q1.top()] < a[i]) {
                                        break;
                                }
                                dp1[i]+= dp1[q1.top()] + 1;
                                q1.pop();
                        }
                        q1.push(i);
                } else {
                    while (!q1.empty()) {
                            if (a[q1.top()] < a[i]) {
                                    break;
                                }
                            dp1[i]+= dp1[q1.top()] + 1;
                            q1.pop();
                        }
                    q1.push(i);
                }
     }
    ll area = -1, l, r;
    for (int i = 0; i < n; i++) {
            int l1 = i - dp[i], r1 = dp1[i] + i;
            if (area < (dp[i] + dp1[i] + 1) * a[i]
                || area == (dp[i] + dp1[i] + 1) * a[i] && r - l +1 >r1 - l1 + 1) {
                    area = (dp[i] + dp1[i] + 1) * a[i];
                    l = i - dp[i];
                    r = i + dp1[i];
            }
            if (area <= a[i]) {
                    area = a[i];
                    l = i;
                    r = i;
            }
    }
    cout << area << endl << l + 1 << ' ' << r + 1;
}