#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };

ll MOD = 1000000007;
ll _MOD = 1000000009;

int main() {
	int N; cin >> N;
	vector<int> v(N + 2);
	for (int i = 0; i < N; i++)
		cin >> v[i];
	N += 2;
	vector<int> dp(N);
	for (int i = 0; i < N; i++) {
		if (i - 2 >= 0) dp[i] = max(dp[i], dp[i - 2]);
		if (i - 3 >= 0) dp[i] = max(dp[i], dp[i - 3]);
		dp[i] += v[i];
	}
	int i = N - 1;
	vector<int> w;
	for (;;) {
		if (i - 2 >= 0 && dp[i - 2] + v[i] == dp[i])
			i -= 2;
		else if (i - 3 >= 0 && dp[i - 3] + v[i] == dp[i])
			i -= 3;
		else break;
		w.push_back(i);
	}
	reverse(w.begin(), w.end());
	cout << dp[N - 1] << endl;
	for (int k = 0; k < w.size(); k++)
		cout << w[k] + 1 << ' ';
	cout << endl;
}