#include <iostream>
#include <cstdio>

using namespace std;

int n,x[6000005];

int main()
{
    freopen("ssm.in","r",stdin);
    freopen("ssm.out","w",stdout);

    cin >> n;

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

    int first = 1,last,best = -int(2e9);
    long long S = 0;

    for(int i = 1; i <= n; i++){
            S += x[i];
        if(S > best)
        {
            best = S;
            last = i;
        }
        if(S < 0)
        {
            S = 0;
            first = i + 1;
            last = 0;
        }
    }

    cout << best << " " << first << " " << last;
    return 0;
}