#include <cassert>
#include <functional>
#include <set>
#include <ctime>
#include <cmath>
#include <climits>
#include <cstring>
#include <string>
#include <queue>
#include <map>
#include <vector>
#include <algorithm>
#include <iostream>
#include <cstdio>
#ifndef ONLINE_JUDGE
# include <complex>
# include <random>
# include <array>
# define mkt make_tuple
#endif
#ifdef _LOCAL
# include "for_local.h"
#else
# define ifdebug if (false)
# define echo ((void)0)
#endif
using namespace std;
typedef unsigned int uint; typedef long long ll; typedef unsigned long long ull;
#define repi(_I, _B, _E) for(int _I = (_B); (_I) < (_E); ++ (_I))
#define rep(_I, _N) for(int _I = 0; (_I) < (_N); ++ (_I))
#define all(_X) (_X).begin(), (_X).end()
#define mkp make_pair
inline int scani() { int n; scanf(" %d", &n); return n; }


int n;
vector<int> vs;
vector<int> dp;

signed main()
{
	cin >> n;
	vs.resize(n);
	rep(i, n)
	{
		cin >> vs[i];
	}

	dp.resize(n + 5);
	rep(i, n)
	{
		dp[i + 1] = max(dp[i + 1], dp[i]);
		dp[i + 2] = max(dp[i + 1], dp[i] + vs[i]);
	}

	cout << dp[n + 1] << endl;
	
	vector<int> ds;
	for ( int i = n; i >= 1; --i ) {
		if ( dp[i + 1] > dp[i] ) {
			ds.push_back(i - 1);
			--i;
		}
	}
	reverse(all(ds));
	for ( auto&& d : ds ) {
		cout << (d + 1) << ' ';
	}

	cout << endl;
	return 0;
}