#include <bits/stdc++.h>
#define int long long
using namespace std;
const int inf = 1e16;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int32_t main()
{
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    fin >> n;
    vector<int> a(n + 1);
    for (int i = 1; i <= n; ++i)
    {
        fin >> a[i];
    }
    vector<int> sp(n + 1);
    for (int i = 1; i <= n; ++i)
    {
        sp[i] = sp[i - 1] + a[i];
    }
    int maxi = -inf, pos = 0;
    int ans = -inf;
    pair<int, int> secv;
    for (int i = n; i >= 1; --i)
    {
        if (sp[i] > maxi)
        {
            maxi = sp[i];
            pos = i;
        }
        else
        {
            if (sp[i] == maxi)
            {
                pos = i;
            }
        }
        int best = maxi - sp[i - 1];
        if (best > ans)
        {
            ans = best;
            secv = {i, pos};
        }
        else
        {
            if (ans == best)
            {
                secv = {i, pos};
            }
        }
    }
    fout << ans << ' ' << secv.first << ' ' << secv.second;
}