#include <stdio.h>
#include <string.h>
int k,m,n,n1=0,m1=0;
int d,dd;
int book[10001];
int a[10000];

int dfs(int i)
{
    printf("i=%d\n",i);
    if(n1==0)
    {
        d = i;dd=i;
        n1 = 1;
    }
    int s=a[i],temp=a[i],j;
    if(i==k){
        return;
    }
    i++;
    j=i;
    if(book[i]>=0){
        return book[i];
    }
    for(i;i<k;i++){
        temp += a[i];
        if(temp < a[i]){
            temp = a[i];
            continue;
        }
        if(temp>s){
            m=i;
            if(m1==0){ dd = i; m1 = 1; }
            s = temp;//最大值
            dfs(i);
        }
    }
    if(s<book[m])
    {
        d = i;
        dd = m;
    }
    printf("d=%d dd=%d\n\n",d,dd);
    book[m] = s;
    printf("s=%d \n",s);
    return s;
}

int main(){
    int i,j,u,p=0;
    while( scanf("%d",&k) && k != 0 )
    {
        p=0;
        d=0;
        dd=0;
        n1=0;
        m1=0;
        memset(a,0,sizeof(a));
        for(i=0;i<k;i++){
            scanf("%d",&a[i]);
            if(a[i]>=0){p=1;}
        }
        if(p==0)
        {
            printf("0 %d %d\n",a[0],a[i-1]);
            continue;
        }
        memset(book,-1,sizeof(book));
        for(u=0;u<k;u++)
        {
            if(a[u]>=0)
            {
                printf("%d ",dfs(u));
                printf("%d %d\n",a[d],a[dd]);
                break;
            }
        }
    }
    return 0;
}