#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second

using namespace std;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef vector <int> vi;
typedef vector <pii> vii;
typedef vector <ll> vl;
typedef vector <pll> vll;
typedef queue <int> qi;
typedef queue <pii> qii;
typedef queue <ll> ql;
typedef queue <pll> qll;

const int INF = 0x3f3f3f3f;
const int MOD = 666013;
const int NMAX = 6000000 + 5;

ifstream fin("ssm.in");
ofstream fout("ssm.out");

int n, l, r, bestSum = -INF, bestL, bestR;
int v[NMAX], best[NMAX];

int main()
{
    fin >> n;
    for (int i = 1; i <= n; ++i)
        fin >> v[i];

    for (int i = 1; i <= n; ++i)
    {
        if (best[i - 1] + v[i] >= v[i])
        {
            best[i] = best[i - 1] + v[i];
            ++r;
        }
        else
        {
            best[i] = v[i];
            l = r = i;
        }

        if (bestSum < best[i])
        {
            bestSum = best[i];
            bestL = l;
            bestR = r;
        }
    }

    fout << bestSum << " " << bestL << " " << bestR;

    return 0;
}