#include <bits/stdc++.h>

using namespace std;

int main()
{
    ifstream fin("ssm.in");
    ofstream fout("ssm.out");

    int n;
    fin >> n;

    vector<int> v(n + 1);
    vector<pair<int, int>> dp(n + 1);
    
    for (int i = 1; i <= n; ++i)
        fin >> v[i];

    dp[0] = {-1e9, 0};

    int best = 1;
    for (int i = 1; i <= n; i++) {
        if (dp[i - 1].first < 0) {
            dp[i] = {v[i], i};
        } else {
            dp[i] = {dp[i - 1].first + v[i], dp[i - 1].second};
        }

        if (dp[i].first > dp[best].first)
            best = i;
    }

    fout << dp[best].first << ' ' << dp[best].second << ' ' << best << '\n';

    return 0;
}