#include <fstream>
#include <algorithm>

using namespace std;
long long a[4][6000005];
int max(int a,int b)
{
    if(a>b)
        return a;
        else
            return b;
}

int main()
{
        ifstream fin("ssm.in");
        ofstream fout("ssm.out");
        long long n,lgmin=6000001,imin=6000000,maxim=0,i,j;
        fin>>n;
        fin>>a[1][1];
        a[2][1]=a[1][1];
        a[3][1]=1;
        for(i=2;i<=n;i++)
        {
            fin>>a[1][i];
            a[2][i]=a[1][i];
            a[3][i]=i;
            if(a[2][i-1]>0)
                {
                    a[2][i]+=a[2][i-1];
                    a[3][i]=a[3][i-1];

                }
            if(a[2][i]>maxim)
            {
                maxim=a[2][i];
                imin=a[3][i];
                lgmin=i-a[3][i]+1;
            }
            else
            if(a[2][i]==maxim&&a[3][i]<imin&&(i-a[3][i]+1)<lgmin)
            {
                maxim=a[2][i];
                imin=a[3][i];
                lgmin=i-a[3][i]+1;
            }
        }
        for(i=1;i<=3;i++)
        {for(j=1;j<=n;j++)
        fout<<a[i][j]<<" ";
        fout<<"\n";
        }
        fout<<maxim<<" "<<imin<<" "<<imin+lgmin-1;



    return 0;
}