#include <cstdio>
#include <algorithm>
using namespace std;
int sp[6000005];

int main()
{
    int n, i, x, maxim = 0, st = 0, dr = 0;
    freopen("ssm.in","r",stdin);
    freopen("ssm.out","w",stdout);
    scanf("%d", &n);
    for(i = 1;i <= n; ++i){
        scanf("%d", &x);
        sp[i] = sp[i - 1] + x;
        if(maxim < sp[i] - sp[st]){
            maxim = sp[i] - sp[st];
            dr = i;
        }
        if(sp[i] < sp[st]){
            st = i;
        }
    }
    printf("%d %d %d\n",maxim,st+1,dr);
    return 0;
}