#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
#include<deque>
#include<list>
#define pb push_back
#define maxn 6000050
using namespace std;
int a[maxn],best[maxn],n,st,dr,i,st_f,bestsum;
int main()
{
    freopen("ssm.in","r",stdin);
    freopen("ssm.out","w",stdout);
    freopen("ssm.in","r",stdin);
    freopen("ssm.out","w",stdout);
    scanf("%d%d",&n,&a[1]);
    bestsum=a[1];
    for(i=1;i<=n;++i)
    {
        if(i!=1)
            scanf("%d",&a[i]);
        best[i]=a[i];
        if(best[i]<best[i-1]+a[i])
            best[i]=best[i-1]+a[i];
        else
            st=i;
        if(bestsum<best[i])
            bestsum=best[i],dr=i,st_f=st;
    }
    printf("%d %d %d\n",bestsum,st_f,dr);
    return 0;
}