import java.util.Arrays;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.Set;

public class Main {
	
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		
		final int N = sc.nextInt();
		
		int[] value = new int[N];
		for(int i = 0; i < N; i++){
			value[i] = sc.nextInt();
		}
		
		int[][] DP = new int[N][2];
		boolean[][] prev = new boolean[N][2];
		for(int i = 0; i < N; i++){
			if(i == 0){
				DP[i][0] = 0;
				DP[i][1] = value[i];
				prev[i][0] = false;
				prev[i][1] = true;
			}else{
				if(DP[i - 1][0] >= DP[i - 1][1]){
					DP[i][0] = DP[i - 1][0];
					prev[i][0] = false;
				}else{
					DP[i][0] = DP[i - 1][1];
					prev[i][0] = true;
				}
				
				DP[i][1] = DP[i - 1][0] + value[i];
				prev[i][1] = false;
			}
		}
		
		LinkedList<Integer> list = new LinkedList<Integer>();
		int eat_flg = 0;
		if(DP[N - 1][0] < DP[N - 1][1]){
			eat_flg = 1;
		}
		
		for(int i = N - 1; i >= 0; i--){
			if(eat_flg == 1){ list.addFirst(i + 1); }
			eat_flg = prev[i][eat_flg] ? 1 : 0;
		}
		
		System.out.println(Math.max(DP[N - 1][0], DP[N - 1][1]));
		boolean first = true;
		for(final int num : list){
			if(first){
				first = false;
			}else{
				System.out.print(" ");
			}
			System.out.print(num);
		}
		System.out.println();
		
	}
	
}