#include <bits/stdc++.h>
using namespace std;
int a[1000010];
int dp[1000010];
int main(){
    freopen("subq.in","r",stdin);
    freopen("subq.out","w",stdout);
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
    }
    dp[0]=-1e9;
    int mx=-1e9,op;
    for(int i=1;i<=n;i++){
        dp[i]=a[i];
        dp[i]=max(dp[i],dp[i-1]+a[i]);
        if(dp[i]>mx){
            mx=dp[i];
            op=i;
        }
        a[i]=a[i-1]+a[i];
    }
    for(int i=1;i<=op;i++){
        if(a[op]-a[i-1]==mx){
            printf("%d\n%d\n%d",i,op,mx);
            return 0;
        }
    }
    return 0;
}