#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e6+5;
int n,a[N],dp[N],maxn=-0x3ffffff,l=1,r=1;
signed main()
{
    freopen("subq.in","r",stdin);
    freopen("subq.out","w",stdout);
    scanf("%lld",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%lld",&a[i]);
    }
    for(int i=1;i<=n;i++)
    {
        dp[i]=dp[i-1]+a[i];
        if(dp[i]>maxn)
        {
            maxn=dp[i];
            r=i;
        }
        if(dp[i]<0)
        {
            dp[i]=0;
            l=i+1;
        }
    }
    printf("%lld\n%lld\n%lld",l,r,maxn);
    return 0;
}