#include <bits/stdc++.h>

using namespace std;

ifstream fin ("ssm.in");
ofstream fout ("ssm.out");

vector <int> v;

int main()
{
    int n;
    fin >> n;
    int a;
    fin >> a;
    v.push_back(a);
    for (int i = 1; i < n; i ++) {
        fin >> a;
        v.push_back(a + v[i - 1]);
    }
    int minim = 0, idx = -1, best = -0x3f3f3f3f, b = -1, e = 0;
    for (int i = 0; i < n; i ++) {
        if (v[i] - minim > best) best = v[i] - minim, e = i, b = idx;
        if (v[i] < minim) minim = v[i], idx = i;
    }
    if (b == 0) b = 1;
    else b += 2;
    fout << best << " " << min(b, e + 1) << " " << e + 1;
    return 0;
}