program subs_pd;
var a,best:array[0..7000000] of longint;
    n,i,bestSum,sum,left,right,idx,x:longint;
begin
assign(input,'ssm.in'); reset(input);
ASSIGN(OUTPUT,'ssm.out'); rewrite(output);
readln(n);
for i:=1 to n do begin
                 read(x);
                 if sum<0 then begin
                               sum:=x;
                               idx:=i;
                               end
                          else sum:=sum+x;
                 if bestsum<sum then begin
                                     bestsum:=sum;
                                     left:=idx;
                                     right:=i;
                                     end;
                 end;


write(bestsum,' ',left,' ',right);
close(output);
end.