#include <bits/stdc++.h>
#define startt ios_base::sync_with_stdio(false);cin.tie(0);
typedef long long  ll;
using namespace std;
#define vint vector<int>
#define all(v) v.begin(), v.end()
#define MOD 1000000007
#define MOD2 998244353
#define MX 1000000000
#define MXL 1000000000000000000
#define PI (ld)2*acos(0.0)
#define nax 200005
#define pb push_back
#define sc second
#define fr first
//#define int long long
#define endl '\n'
#define ld long double
#define NO cout << "NO" << endl
#define YES cout << "YES" << endl
																																						//int ceildiv(int one, int two) {if (one % two == 0) {return one / two;}else {return one / two + 1;}} int power(int n, int pow, int m) {if (pow == 0) return 1;if (pow % 2 == 0) {ll x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;} int gcd(int a, int b) { if (!b)return a; return gcd(b, a % b);} int factorial(int n, int mod) {if (n > 1)return (n * factorial(n - 1, mod)) % mod; else return 1;} int lcm(int a, int b) {return (a * b) / gcd(a, b);} vector<int> read(int n) {vector<int> a; for (int i = 0; i < n; i++) { int x; cin >> x; a.pb(x);} return a;}//ssense
void solve()
{
	int n;
	cin >> n;
	int pref[n+2];
	pref[0] = 0;
	for(int i = 0; i < n; i++)
	{
		int a;
		cin >> a;
		pref[i+1] = pref[i]+a;
	}
	int mnpref = 0;
	int ans = -MX;
	int index1 = 0, index2 = 0;
	for(int i = 1; i <= n; i++)
	{
		int ansnow = pref[i]-mnpref;
		if(ansnow > ans)
		{
			ans = ansnow;
			index2 = i;
		}
		if(pref[i] < mnpref)
		{
			mnpref = pref[i];
			index1 = i;
		}
	}
	cout << ans << " " << index1+1 << " " << index2 << endl;
}
 
int32_t main(){
	startt;
	freopen("ssm.in", "r", stdin);
	freopen("ssm.out", "w", stdout);
	int t = 1;
	//cin >> t;
	while (t--)
	{
		solve();
	}
}