#include <bits/stdc++.h>

using namespace std;
const int NMAX=1e6+5;
int i,n,v[NMAX];
int main()
{
    freopen("ssm.in","r",stdin);
    freopen("ssm.out","w",stdout);
    scanf("%d \n", &n);
    for (int i = 1; i <= n; ++i)
        scanf("%d ", &v[i]);
    int best=0,s=0,first=0,last=0,idx=0;
    for (int i = 1; i <= n; ++i)
    {
        if (s < 0)
            s = v[i], idx=i;
        else  s+=v[i];
        if (s > best)
            best= s, first=idx, last=i;
    }
    printf("%d %d %d", best, first, last);
    return 0;
}