#include <fstream>
#include <bitset>

using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");

const int N = 6e6 + 6;
int n, i, x, mn, sum[N];
int bestSum, ind, st, dr;

int main()
{
    in >> n;

    for(i = 1; i <= n; i++)
    {
        in >> x;

        sum[i] = sum[i-1] + x;

        if(sum[i] - mn > bestSum)
            bestSum = sum[i] - mn, st = ind + 1, dr = i;

        if(sum[i] < mn)
            mn = sum[i], ind = i;
    }

    out << bestSum << ' ' << st << ' ' << dr;

    return 0;
}