int a[20];
int main() 
{
	int n,i;
	scanf("%d",&n);
	for(i = 0; i < n; i++) 
	{
		scanf("%d",&a[i]);
	}
	int max= 0;         //最大值
	int maxIndex = 0;  //起始位置下标
	for(i = 0; i < n; i++) 
	{
		int num = a[i] + a[ (i + 1) % n  ]  + a[  (i + 2) % n  ] + a[  (i + 3) % n  ];
		if(num > max) 
		{
			max = num;
			maxIndex = i;
		}
	}
	printf("%d %d",max,maxIndex+1);
}
/**************************************************************
	Problem: 1163
	User: admin
	Language: C
	Result: Accepted
	Time:10 ms
	Memory:1144 kb
****************************************************************/