using namespace std;

#include <set>
#include <map>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include <cctype>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <utility>
#include <iomanip>
#include <fstream>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>

#define oo (1<<30)
#define f first
#define s second
#define II inline
#define db double
#define ll long long
#define pb push_back
#define mp make_pair
#define Size(V) ((ll)(V.size()))
#define all(V) (V).begin() , (V).end()
#define CC(V) memset((V),0,sizeof((V)))
#define CP(A,B) memcpy((A),(B),sizeof((B)))
#define FOR(i,a,b) for(ll (i)=(a);(i)<=(b);++(i))
#define REP(i, N) for (ll (i)=0;(i)<(ll)(N);++(i))
#define FORit(it, x) for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); ++it)
#define printll(x) printf("%lld",(x))
#define printsp() printf(" ")
#define newline() printf("\n")
#define readll(x) scanf("%lld",&(x))
#define debugll(x) fprintf(stderr,"%lld\n",(x))

#define IN "ssm.in"
#define OUT "ssm.out"

//#define ONLINE_JUDGE

int solLen;
int solEnd;
int solSum;


int prevSum;
int prevLength;

int s;
int l;

int size;

void solve(int test) {
  prevSum = -oo;
  prevLength = oo;
  solLen = oo;
  solSum = -oo;
  solEnd = -1;

  cin >> size;
  for (int i = 0; i < size; i++)
  {
    int num;
    cin >> num;
    if (i > 0 && prevSum + num > num)
    {
      s = prevSum + num;
      l = prevLength + 1;
    } 
    else
    {
      s = num;
      l = 1;
    }
    if (s > solSum || (s == solSum && l < solLen))
    {
      solSum = s;
      solLen = l;
      solEnd = i;
    }
//  cerr << s << " " << i + 2 - l << " " << i + 1 << endl;

    prevLength = l;
    prevSum = s;

  }

  cout << solSum << " " << solEnd + 2 - solLen << " " << solEnd + 1;
}

int main() {
#ifndef ONLINE_JUDGE
  freopen(IN,"r",stdin);
  freopen(OUT,"w",stdout);
#endif
    solve(1);
  return 0;
}