#include <cstdio>
#include <algorithm>

using namespace std;

int i, sum, maxi=-999999, n, v[6000005], e, beg, t;

int main()
{
    freopen ("ssm.in", "r", stdin);
    freopen ("ssm.out", "w", stdout);
    scanf ("%d", &n);
    for (i=1; i<=n; i++) scanf ("%d", &v[i]);
    for (i=1; i<=n; i++)
    {
        if (sum<0) {sum=v[i]; t=i;}
        else sum+=v[i];
        if (sum>maxi) {maxi=sum; e=i; beg=t;}
    }
    printf ("%d %d %d", maxi, beg, e);
}