#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<unordered_map>

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>

using namespace std;

const int inf = (1LL << 31) - 1;

int n, i, x, smin, poz, a, b, s, best;

int main()
{
    freopen("ssm.in", "r", stdin);
    freopen("ssm.out", "w", stdout);

    scanf("%d", &n);

    smin = poz = 0;
    best = -inf;

    for(i = 1; i <= n; i++)
    {
        scanf("%d", &x);
        s += x;

        if(s - smin > best)
        {
            best = s - smin;
            a = poz + 1;
            b = i;
        }

        if(s < smin)
        {
            smin = s;
            poz = i;
        }
    }

    printf("%d %d %d\n", best, a, b);

    return 0;
}