#include <cstdio>
#include <algorithm>
using namespace std;

int n;

int main(){
    int best,p,u,best1,p1,x;
    freopen("ssm.in","r",stdin);
    freopen("ssm.out","w",stdout);
        scanf("%d",&n);
        scanf("%d",&x); // read first value
        best = best1 = x; p = u = p1 = 1;
        for(int i=2;i<=n;i++)
        {
            scanf("%d",&x);
            if(best1+x>x)best1 += x; else
            {
                best1 = x;
                p1 = i;
            }
            if(best1>best)
            {
                best = best1;
                p = p1;
                u = i;
            }
        }
    printf("%d %d %d\n",best,p,u);
    return 0;
}