#include <fstream>
#include <algorithm>

using namespace std;

ifstream f("ssm.in");
ofstream g("ssm.out");
long long n, x;

int main()
{
	f >> n;
	long long sum = 0;
	long long Max = -1;
	long long left = 1, right;
	for (long long i = 1;i <= n;i++)
	{
		f >> x;
		sum += x;
		if (sum < 0)
		{
			left = i + 1;
			sum = 0;
		}
		else
			if (Max < sum)
			{
				Max = sum;
				right = i;
			}
	}
	g << Max << " " << left << " " << right << "\n";
	f.close();
	g.close();
	return 0;
}