//#include <bits/stdc++.h>
#include <fstream>
#include <vector>
#include <bitset>
#include <unordered_map>
#include <algorithm>
#include <queue>
#include <math.h>
#include <iomanip>
 
using namespace std;

const int INF = 0x3f3f3f3f;

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

const int N = 6e6 + 6;

int ans;
int v[N];

main()
{
	int n;
	cin >> n;
	
	int l_curent = 0;
	
	int l, r;
	
	l = 1;
	r = 1;
	
	l_curent = 1;
	
	cin >> v[1];
	ans = v[1];
	
	
	for(int i = 2; i <= n; i++)
	{
		cin >> v[i];
		if(v[i] + v[i - 1] > v[i])
		{
			v[i] += v[i - 1];
		}
		else
		{
			l_curent = i;
		}
		
		if(v[i] > ans)
				ans = v[i], l = l_curent, r = i;

	}
	
	cout << ans << ' ' << l << ' ' << r;
}