#include <bits/stdc++.h>
using namespace std;
int main()
{
    int a[150],n,zf,s,max,p;
    bool f;
    cin>>n;
    for (int i=0;i<n;i++)
    {
        cin>>a[i];
          
    }
    max=a[0]+a[(0+1)%n]+a[(0+2)%n]+a[(0+3)%n];
    p=0;
    for (int i=0;i<n;i++)
    {
        s=a[i]+a[(i+1)%n]+a[(i+2)%n]+a[(i+3)%n];
        if (s>max) 
        {
            max=s;
            p=i;
        }
          
    }
    cout<<max<<endl<<p+1<<endl;
    return 0;
}
/**************************************************************
	Problem: 1163
	User: linmiaoling
	Language: C++
	Result: Accepted
	Time:10 ms
	Memory:2072 kb
****************************************************************/