#include <fstream>
#include <algorithm>
using namespace std;
#define maxn 6000005
#define INF 2000000000


int S[maxn];
int N;

int main()
{
    int i;
    ifstream fin("ssm.in");
    fin >> N;
    for (i = 1; i <= N; ++i) fin >> S[i];
    int bestSum = -INF, sum = 0, a, b, idx;
    for (i = 1; i <= N; ++i)
    {
        if (sum < S[i]) {sum = S[i]; idx = i; }
            else
            sum += S[i];
        if (bestSum < sum)
            { bestSum = sum; a = idx; b = i; }
    }
    ofstream fout("ssm.out");
    fout << bestSum << " " << a << " " << b;
    return 0;
}