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

const int N = 6000001;
int s[N];

int main() {
    freopen("ssm.in", "r", stdin);
    freopen("ssm.out", "w", stdout);
    int n, x, smin = 0, smax = -2000000001, ind = 0, a1, a2;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &x);
        s[i] = s[i - 1] + x; }

    for (int i = 1; i <= n; i++) {
        if (s[i] - smin > smax) {
            smax = s[i] - smin;
            a1 = ind + 1;
            a2 = i; }
        if (s[i] < smin) {
            smin = s[i];
            ind = i; } }
    printf("%d %d %d", smax, a1, a2);
    return 0; }