#include <bits/stdc++.h>
#define ll long long
#define all(a) (a).begin(), (a).end()
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz() size()
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in insert
#define pi pair<int,int>
#define pii pair<pair<int,int>,int>
#define mp make_pair
//#define int long long
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
using namespace std;

const int mod=1e9+7;
const int modx=998244353;
const int per=666013;

int n,a[6000005],dp[6000005];

int32_t main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
    srand(chrono::steady_clock::now().time_since_epoch().count());
    ifstream fin("ssm.in");
    ofstream fout("ssm.out");
    fin >> n;
    for(int i=1;i<=n;i++) fin >> a[i];
    dp[1]=a[1];
    for(int i=2;i<=n;i++){
        dp[i]=max(dp[i-1]+a[i],a[i]);
    }
    int ans=-1e18,last=0,first=0;
    for(int i=1;i<=n;i++){
        if(ans<dp[i]){
            ans=max(ans,dp[i]);
            last=i;
        }
    }
    int sum=0;
    sum+=a[last];
    first=last;
    while(sum!=ans){
        first--;
        sum+=a[first];
    }
    fout << ans << ' ' << first << ' ' << last << '\n';
}