package no258;

import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] v = new int[n];
		for (int i = 0; i < n; i++) {
			v[i] = sc.nextInt();
		}
		int[][] dp = new int[n + 1][2];
		for (int i = 1; i <= n; i++) {
			dp[i][0] = Math.max(dp[i - 1][0], dp[i - 1][1]);
			dp[i][1] = dp[i - 1][0] + v[i - 1];
		}
		System.out.println(Math.max(dp[n][0], dp[n][1]));
		ArrayList<Integer> sushi = new ArrayList<>();
		int now = dp[n][0] >= dp[n][1] ? 0 : 1;
		for(int i=n-1;i>=0;i--) {
			if (now == 0) {
				now = dp[i][0] >= dp[i][1] ? 0 : 1;
			}else{
				sushi.add(i+1);
				now = 0;
			}
		}
		Collections.reverse(sushi);
		StringBuilder sb = new StringBuilder();
		for(int i=0;i<sushi.size();i++) {
			if (i > 0) {
				sb.append(' ');
			}
			sb.append(sushi.get(i));
		}
		System.out.println(sb);
	}

}