#include <fstream>
#include <vector>
#include <stdlib.h>

using namespace std;

long long s=-1,q,w;
vector <int> a;

ifstream cin ( "ssm.in");
ofstream cout("ssm.out");

void read()
{
	int n;
	
	cin >> n;
	a.resize(n);

	for (int i = 0; i < a.size(); i++)
		cin >> a[i] ;
}

void solve()
{
	vector <vector <int> > x(a.size() );
	for (int i = 0; i < x.size(); i++)
		x[i].resize(x.size() );

	for (int i = 0; i < x.size(); i++)
	{
		x[i][i] = a[i];
		for (int j = i + 1; j < x.size(); j++ ) // x.size() == x[i].size() pentru orice 0 <= i < x.size()
			x[i][j] = x[i][j-1] + a[j];
	}

	for (int i = 0; i < x.size(); i++)
		for (int j = i; j < x.size(); j++)
			if (x[i][j] > s)
			{
				s = x[i][j];
				q = i;
				w = j;
			}
}

void write()
{
	cout << s << ' ' << q+1 << ' ' << w+1 ;
}

int main()
{
	read();

	solve();

	write();
	
	return 0;
}