import java.util.ArrayDeque;
import java.util.Deque;
import java.util.Scanner;


public class Main_yukicoder258 {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        int[] dp = new int[n + 1];
        int[] prev = new int[n + 1];
        boolean[] used = new boolean[n + 1];
        for (int i = 1; i <= n; i++) {
        	int v = sc.nextInt();

        	if (i == 1) {
        		dp[i] = v;
        		prev[i] = 0;
        		used[i] = true;
        	} else {
        		if (dp[i - 1] <= dp[i - 2] + v) {
        			dp[i] = dp[i - 2] + v;
        			prev[i] = i - 2;
        			used[i] = true;
        		} else {
        			dp[i] = dp[i - 1];
        			prev[i] = i - 1;
        		}
        	}
        }

        System.out.println(dp[n]);
        Deque<Integer> st = new ArrayDeque<Integer>();
        for (int i = n; i > 0; ) {
        	if (used[i]) {
        		st.push(i);
        	}
    		i = prev[i];
        }
        boolean flag = false;
        for (int e : st) {
        	if (flag) {
        		System.out.print(" ");
        	}
        	flag = true;
        	System.out.print(e);
        }
        System.out.println("");

        sc.close();
    }
}