#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

int dp[1004];
int N;
int V[1003];

int main(int argc, char **argv) {
	cin >> N;
	REP(i, N) cin >> V[i + 2];
	V[0] = V[1] = V[N + 2] = 0;
	dp[N + 2] = dp[N + 3] = 0;
	dp[N + 1] = V[N + 1];
	for (int i = N; i >= 0; --i) dp[i] = V[i] + max(dp[i + 2], dp[i + 3]);
	int i = 0;
	cout << dp[0] << endl;
	while(true) {
		if (dp[i] == V[i] + dp[i + 2]) i += 2;
		else i += 3;
		if (i >= N + 2) break;
		if (i >= 4) cout << " ";
		cout << (i - 1);
	}
	cout << endl;
	return 0;
}