#include <bits/stdc++.h>
using namespace std;

/**

dp[i] - suma maxima a unei secvente care se termina in i

*/

const int MAX = 6000005;
int a[MAX], dp[MAX];

int main()
{
    ifstream cin("ssm.in");
    ofstream cout("ssm.out");
    int n, maxim = INT_MIN, st = 1, dr, left, right;
    cin >> n;

    for (int i = 1; i <= n; ++i)
        cin >> a[i];

    dp[1] = a[1];
    for (int i = 2; i <= n; ++i)
    {
        if (dp[i-1] + a[i] > a[i])
        {
            dp[i] = dp[i-1] + a[i];
            dr = i;
        }
        else
        {
            st = i;
            dp[i] = a[i];
        }

        if (dp[i] > maxim)
        {
            maxim = dp[i];
            left = st, right = dr;
        }
        else if (dp[i] == maxim)
        {
            if (dr - st + 1 < right - left + 1)
                left = st, right = dr;
        }
    }

    cout << maxim << " " << left << " " << right;

    return 0;
}