#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");

int main()
{
    long long n;
    fin>>n;

    long long v[n+1];
    for(int i=1; i<=n; i++)
    {
        fin>>v[i];
    }
    long long s=v[1];
    long long dr=1,maxx=s,st=1,p=1;
    for(int i=2; i<=n; i++)
    {
        if(s+v[i]>=v[i])
        {
            s=s+v[i];
        }
        else
        {
            s=v[i];
            st=1;
        }
        if(maxx<s)
        {
            maxx=s;
            p=st;
            dr=i;
        }
    }
    fout<<maxx<<" "<<p<<" "<<dr;

    return 0;
}