#include<iostream>
using namespace std;
int n, head = 1, tail, ans1=-100000,ans2;
long long a[2000001], sum[2000001], q[2000001];
int main()
{
    cin >> n;
    for ( int i = 1; i <= n; i ++)
        cin >> a[i];
    for (int i = 1; i <= n; i ++)
        a[i + n] = a[i];
    for (int i = 1; i <= 2 * n; i ++)
        sum[i] = sum[i - 1] + a[i];
    for (int k = 1; k <= n - 1 ; k ++)
    {
        while (head <= tail && sum[k] >= sum[q[tail]])
            tail--;
        q[++tail] = k;
    }
    for (int k = 1; k <= n ; k ++)
    {
        if (head <= tail && k > q[head])
            head++;
        while (head <= tail && sum[k + n - 1] >= sum[q[tail]])
            tail--;
        q[++tail] = k + n - 1;
        if (sum[q[head]] - sum[k - 1] >= ans1)
            ans1=sum[q[head]] - sum[k - 1],ans2=k;
    }
    cout << ans2 << " " << ans1;
    return 0;
}