#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <bits/stdc++.h>
using namespace std;

#define NRFEST 10005
#define NMAX 6000000

ifstream fin("ssm.in");
ofstream fout("ssm.out");

unsigned long long n;
long long v[NMAX];

long long max(unsigned long long x1,unsigned long long x2)
{
    if(x1>x2)
        return x1;
    else return x2;
}

int main()
{
    fin>>n;

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




    int idx = 1;
    long long sum=0;
    long long bestSum= -int(2e9);
    int end=0,start=1;

    for(int i = 1;i<=n;i++)
    {
        if(sum < 0)
        {
            sum = v[i];
            idx = i;
        }
        else
        {
            sum+=v[i];
        }
        if(bestSum < sum)
        {
            bestSum = sum;
            start = idx;
            end = i;
        }
    }


    fout<<bestSum<<" "<<start<<" "<<end;

    return 0;
}