#include<iostream>

#include<cstring>

#include<cmath>

#include<queue>

#include<algorithm>

#include<cstdio>

using namespace std;

#define LL long long

#define INF 0x3f3f3f3f

int main()

{

    int k,dp[],a[];

    while(scanf("%d",&k)!=EOF,k)

    {

        int maxn=-INF,left,right,flag;

        dp[]=;

        for(int i=;i<=k;i++)

        {

            scanf("%d",&a[i]);

            if(dp[i-]>){

                dp[i]=dp[i-]+a[i];

            }

            else {

                dp[i]=a[i];

                flag=i;

            }

            if(maxn<dp[i]){

                left=flag;

                right=i;

                maxn=dp[i];

            }

        }

        if(maxn<){

            maxn=,left=,right=k;

        }

        printf("%d %d %d\n",maxn,a[left],a[right]);

    }

    return ;

}