#include    <iostream>
#include    <fstream>

using namespace std;

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

short int N, v[100];

void read()
{
    fin >> N;
    for(int i = 0; i < N; i++)
    {
        fin >> v[i];
    }
}

void solve()
{
    int sum = 0, bestL = 0, bestI = 0;
    int bestSum = -999999;
    for (int i = 0; i < N; i++)
    {
        sum += v[i];
        if (sum < v[i])
        {
            sum = v[i];
            bestI = i;
        }
        else if (sum > bestSum)
        {
            bestSum = sum;
            bestL = i;
        }
    }
    bestI += 1;
    bestL += 1;
    fout << bestSum << " " << bestI << " " << bestL;
}
int main()
{
    read();
    solve();
    return 0;
}