#include <bits/stdc++.h>
using namespace std;

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

int V[6000001];

int main() {
    int n;
    fin >> n;

    for (int i = 1; i <= n; i++)
        fin >> V[i];

    int s = V[1];
    int smax = INT_MIN;
    int start = 1;
    int bests = 1, beste = 1;

    for (int i = 2; i <= n; i++) {
        int m = max(s + V[i], V[i]);

        if (m == V[i]) start = i;
        s = m;

        if (s > smax || (s == smax && start < bests)) {
            smax = s;
            bests = start;
            beste = i;
        }
    }

    fout << smax << " " << bests << " " << beste;
    return 0;
}