#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define pb push_back
#define mp make_pair
#define f first
#define s second
 
void solve(){
    int n;
    cin >> n;
    vi a(n), dp(n);
    for(int i = 0; i < n; i++)
        cin >> a[i];
    dp[0] = a[0];
    int maxsum = a[0], curl = 0, curr = 1, l = 0, r = 0, cursum = a[0];
    for(; curr < n; curr++){
        //cout << cursum << '\n';
        if(cursum < 0){
            curl = curr;
            cursum = a[curr];
        } else cursum += a[curr];
        if(cursum > maxsum){
            l = curl;
            r = curr;
            maxsum = cursum;
        }
    }
    cout << maxsum << ' ' << l+1 << ' ' << r+1 << '\n';
}  
 
int main(){
    freopen("ssm.in", "r", stdin);
    freopen("ssm.out", "w", stdout);
    ios::sync_with_stdio(0); cin.tie(0);
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
}