#include <bits/stdc++.h>
#define ios ios::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define enter cout << '\n'

using namespace std;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef vector <int> vi;
typedef vector <pii> vii;
typedef vector <ll> vl;
typedef vector <pll> vll;
typedef queue <int> qi;
typedef queue <pii> qii;
typedef queue <ll> ql;
typedef queue <pll> qll;

const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 9;
const double EPSILON = 1e-10;
const int NMAX = 1e3 + 5;

int n;
int v[NMAX];

int main()
{
    fin >> n;
    for (int i = 1; i <= n; ++i)
        fin >> v[i];

    int sum = 0, best = 0, start = 0, finish = 0;
    for (int i = 1; i <= n; ++i)
    {
        sum += v[i];
        if (sum < 0)
        {
            start = i + 1;
            sum = 0;
        }
        else if (sum > best)
        {
//            start = finish;
            finish = i;
            best = sum;
        }
    }

    fout << best << " " << start << " " << finish;

    return 0;
}