#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int a[1000006];
int f[1000006];
int main() {
    freopen("subq.in","r",stdin);
    freopen("subq.out","w",stdout);
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    for(int i=1;i<=n;i++){
        f[i]=max(a[i],f[i-1]+a[i]);
    }
    int ans=0;
    f[0]=-2147483648ll;
    for(int i=1;i<=n;i++){
        if(f[ans]<f[i])ans=i;
    }
    int fr;
    int tot=0;
    for(int i=ans;i>=1;i--){
        tot+=a[i];
        if(tot==f[ans]){
            fr=i;
        }
    }
    cout<<fr<<endl;
    cout<<ans<<endl;
    cout<<f[ans];
    return 0;
}