import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.util.Scanner;


public class Main {
	public static void main(String[] args){
		new Main().run();
	}
	
	int n;
	long[] arr;
	
	public void run(){
		
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		
		int[] arr = new int[n];
		for(int i=0; i<n; i++){
			arr[i] = sc.nextInt();
		}
		
		int lo = 0;
		int hi = 1;
		int sum = arr[0] + arr[1];
		int index = 0;
		int prefixSum = arr[0];
		
		int bestSum = sum;
		int bestLo = 0;
		int bestHi = 1;
		
		while(true){
			// Removes bad prefixes that sum to a negative value. 
			while(true){
				if(hi-index <= 1){
					break;
				}
				if(prefixSum<0){
					sum -= prefixSum;
					lo = index+1;
					index++;
					prefixSum = arr[index];
					break;
				}else{
					prefixSum += arr[++index];
				}
			}
			
			if(sum > bestSum){
				bestSum = sum;
				bestLo = lo;
				bestHi = hi;
			}
			
			if(hi==arr.length-1){
				break;
			}
			
			sum += arr[++hi];
		}
		System.out.println("ANS : " + bestSum);
		System.out.println("Interval : " + bestLo + " to " + bestHi);
	}
	
}