#include <bits/stdc++.h>
using namespace std;

int num[10005];
int db[10005];
int main () {
    int n;
    while (cin >> n) {
        if (n == 0) {
            break;
        }
        bool all_negtive = true;
        for (int i = 0; i < n; i++) {
            cin >> num[i];
            if (num[i] >= 0)
                all_negtive = false;
        }
        if (all_negtive) {
            cout<<"0 "<<num[0]<<" "<<num[n-1]<<endl;
            continue;
        }
        db[0] = num[0];
        long long maxnum = num[0];
        int start = 0,end = 0;
        int best_start=0,best_end=0;

        for (int i = 1; i < n; i++) {
            if (db[i-1]+num[i] < num[i]) {
                db[i] = num[i];
                start = i;
                end = i;
            }
            else {
                db[i] = db[i-1]+num[i];
                end = i;
            }
            if (maxnum < db[...