#include <iostream>
#include <fstream>
using namespace std;
int n,pre[6000001], best[6000001],i,a,b,c,maxim,v[6000001];
int main()
{
    ifstream f("ssm.in");
    ofstream g("ssm.out");
    f>>n;
    for (i=1;i<=n;i++)
          f>>v[i];
    best[n]=v[n];
    pre[n]=n;
    for (i=n-1;i>=1;i--)
         if (v[i]+best[i+1]>v[i])
               {
                   best[i]=v[i]+best[i+1];
                   pre[i]=pre[i+1];
               }
         else
               {
                   best[i]=v[i];
                   pre[i]=i;
               }
    for (i=1;i<=n;i++)
         if (best[i]>maxim)
              {
                  maxim=best[i];
                  a=best[i];
                  b=i;
                  c=pre[i];
              }
    g<<a<<" "<<b<<" "<<c;
    return 0;
}