#include <iostream>
#include <fstream>

using namespace std;

int main()
{
    ifstream f("ssm.in");
    ofstream g("ssm.out");

    long long x, i, imx, imn, n, s[100001], best[100001], mn, bests;
    s[0] = 0;
    f>>n;
    for (i = 1; i <= n; i++) {
        f>>x;
        s[i] = s[i - 1] + x;
    }

    mn = s[0];
    bests = -4294967297;

    for (i = 1; i <= n; i++) {
        best[i] = s[i] - mn;
        if (mn > s[i]) {
            mn = s[i];
            imn = i + 1;
        }
        if (bests < best[i]) {
            bests = best[i];
            imx = i;
        }
    }

    cout<<bests<<" "<<imn<<" "<<imx;

    return 0;
}