#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int n;
int memo[1010];
int values[1000];

int CalcMaxValue(int index) {

	if (index >= n)
		return 0;

	if (memo[index] != -1)
		return memo[index];

	int ret = max(
		values[index] + CalcMaxValue(index + 2),
		CalcMaxValue(index + 1));

	memo[index] = ret;

	return ret;
}

int main() {
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> values[i];
		memo[i] = -1;
	}

	cout << CalcMaxValue(0) << endl;

	vector<int> result;
	
	int i = 0;
	while (i < n)
	{
		if (memo[i] == memo[i + 1]) {
			i++;
			continue;
		}
		result.emplace_back(i + 1);
		i += 2;
	}

	for (int i = 0; i < result.size(); i++) {
		cout << result[i];
		if (i < result.size() - 1)
			cout << " ";
	}
	cout << endl;
	
	return 0;
}