#include <iostream>
#include <fstream>
using namespace std;

ifstream f("ssm.in");
ofstream g("ssm.out");
long n;
long i,j;
long a[6000000],dp[6000000];
int maxi,prim,doi,s;
int main()
{
    f>>n;
    for(i=n;i>=1;i--){
        f>>a[i];
    }
    for(i=1;i<=n;i++){
        if(dp[i-1]>=0) dp[i]=dp[i-1]+a[i];
        else {
                dp[i]=a[i];
                doi=n-i+1;
        }
        if(dp[i]>maxi) {
                maxi=dp[i];
                prim=n-i+1;
        }
    }
    g<<maxi<<" "<<prim<<" "<<doi;
    return 0;
}