#include<fstream>
#define MAXN 6000002
#define FOR(i, a, b)  for (int i = (a); i <= (b); ++ i)
#define Max(a, b)  ((a) > (b) ? (a) : (b))
using namespace std;
ifstream f("ssm.in"); ofstream g("ssm.out");
int n,a[MAXN];
int main()
{f>>n;
 FOR (i, 1, n)  f >> a[i];
 int bestSum = -int(2e9), beg, end;
 FOR (i, 1, n) FOR (j, i, n) 
	{	int sum = 0;
        FOR (k, i, j)  sum += a[k];
        if (sum > bestSum) bestSum = sum, beg = i, end = j;
    }
 g<< bestSum << " " << beg << " " << end <<'\n';
 g.close(); return 0;
}