#include <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
	int N;
	cin >> N;

	vector<int> V(N);
	for (int i = 0; i < N; ++i) {
		cin >> V[i];
	}

	vector<bool> toru(N);
	fill(toru.begin(), toru.end(), false);

	for (int count = 0; count < 100; ++count) {
		for (int i = 0; i < N; ++i) {
			if (i == 0 ||
				(V[i] > V[i - 1]) ||
				(i - 1 != 0 && toru[i - 2])) {

				if (i == N - 1 ||
					(V[i] > V[i + 1]) ||
					(i + 1 != N - 1 && toru[i + 2])) {

					toru[i] = true;
				}
			}
		}
	}

	int sum = 0;
	for (int i = 0; i < N; ++i) {
		if (toru[i]) {
			sum += V[i];
		}
	}

	cout << sum << endl;
	for (int i = 0; i < N; ++i) {
		if (toru[i]) {
			cout << (i + 1) << " ";
		}
	}
	cout << endl;

	getchar();
	getchar();
}