#include <iostream>

using namespace std;

int n,  v[6000005], dp[6000005];
int index[6000005];

int main()
{
    freopen("ssm.in", "r", stdin);
    freopen("ssm.out", "w", stdout);
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);

    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> v[i];
    }

    int max_len = -1e9;
    int len = 1e9, idx_start = 1, idx_end = 1;
    index[1] = 1;
    for (int i = 1; i <= n; i++)
    {
        dp[i] = max(dp[i - 1] + v[i], v[i]);
        if (dp[i] == v[i])
            index[i] = i;
        else
            index[i] = index[i - 1];

        if (dp[i] > max_len) {
            max_len = dp[i];
            idx_start = index[i];
            idx_end = i;
        }
        else if (dp[i] == max_len) {
            if (idx_end - idx_start > i - index[i]) {
                idx_start = index[i];
                idx_end = i;
            }
        }
    }

    /*
    for (int i = 1; i <= n; i++) {
        cout << dp[i] << " ";
    }
    cout << endl;
    for (int i = 1; i <= n; i++) {
        cout << index[i] << " ";
    }
    cout << endl;
    */

    cout << max_len << " " << idx_start << " " << idx_end << endl;

    return 0;
}