#include <iostream>
#include <stdio.h>
using namespace std;

long long best[6000001];
long long buffer[6000001];
int maxSUM = -1000000, minSUM = 1000000;
int mx, mi, begi;
int SUM;

int main () {
    freopen("ssm.in", "r", stdin);
    freopen("ssm.out", "w", stdout);
    int Load;
    cin >> Load;
    cin >> best[0];
    for (int i = 1; i < Load; i++) {
        scanf("%lld", &buffer[i]);
        if (best [i - 1] >= 0)
            best[i] = best[i-1] + buffer[i];
        else {
            best[i] = buffer[i];
            begi = i;
        }

        if (best[i] > maxSUM) {
            maxSUM = best[i], mx = i; mi = begi;
        }
    }

    cout << best[mx] << " " << mi + 1 << " " << mx + 1;
}