# include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); };
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); };
const int vy[] = { -1, -1, -1, 0, 1, 1, 1, 0 }, vx[] = { -1, 0, 1, 1, 1, 0, -1, -1 };
const int dx[4] = { -1,0,1,0 }, dy[4] = { 0,-1,0,1 };
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(LL n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(LL n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
LL gcd(LL a, LL b) { if (b == 0)return a; return gcd(b, a%b); };
LL lcm(LL a, LL b) { LL g = gcd(a, b); return a / g*b; };
# define ALL(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        (wpwpw).erase(unique(ALL((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(ALL((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(ALL((rprpr)),(rprpr).begin(),TU<char>)
# define FOR(i,tptpt,ypypy)   for(LL i=(tptpt);i<(ypypy);i++)
# define REP(i,upupu)         FOR(i,0,upupu)
# define INIT                 std::ios::sync_with_stdio(false);std::cin.tie(0)
# pragma warning(disable:4996)

int n;
int v[1010];
int dp[2][1010];
pair<int, int> pre[2][1010];

int main() {
	cin >> n;
	REP(i, n)cin >> v[i];
	REP(i, 2)REP(j, n)pre[i][j] = make_pair(-1, -1);
	REP(i, n) {
		dp[1][i] = max({ (i - 1 >= 0 ? dp[0][i - 1] : 0),(i - 2 >= 0 ? dp[0][i - 2] : 0),(i - 2 >= 0 ? dp[1][i - 2] : 0) }) + v[i];
		dp[0][i] = max({ (i - 1 >= 0 ? dp[1][i - 1] : 0),(i - 2 >= 0 ? dp[1][i - 2] : 0) });
		if (i - 1 >= 0 && max({ (i - 1 >= 0 ? dp[0][i - 1] : 0),(i - 2 >= 0 ? dp[0][i - 2] : 0),(i - 2 >= 0 ? dp[1][i - 2] : 0) }) == dp[0][i - 1]) {
			pre[1][i] = make_pair(0, i - 1);
		}
		if (i - 2 >= 0 && max({ (i - 1 >= 0 ? dp[0][i - 1] : 0),(i - 2 >= 0 ? dp[0][i - 2] : 0),(i - 2 >= 0 ? dp[1][i - 2] : 0) }) == dp[0][i - 2]) {
			pre[1][i] = make_pair(0, i - 2);
		}
		if (i - 2 >= 0 && max({ (i - 1 >= 0 ? dp[0][i - 1] : 0),(i - 2 >= 0 ? dp[0][i - 2] : 0),(i - 2 >= 0 ? dp[1][i - 2] : 0) }) == dp[1][i - 2]) {
			pre[1][i] = make_pair(1, i - 2);
		}
		if (i - 1 >= 0 && max({ (i - 1 >= 0 ? dp[1][i - 1] : 0),(i - 2 >= 0 ? dp[1][i - 2] : 0) }) == dp[1][i - 1]) {
			pre[0][i] = make_pair(1, i - 1);
		}
		if (i - 2 >= 0 && max({ (i - 1 >= 0 ? dp[1][i - 1] : 0),(i - 2 >= 0 ? dp[1][i - 2] : 0) }) == dp[1][i - 2]) {
			pre[0][i] = make_pair(1, i - 2);
		}
	}
	cout << max(dp[0][n - 1], dp[1][n - 1]) << endl;
	vector<int>ans;
	if (dp[0][n - 1] > dp[1][n - 1]) {
		auto a = pre[0][n - 1];
		while (a != make_pair(-1, -1)) {
			if (a.first == 1) {
				ans.emplace_back(a.second);
			}
			a = pre[a.first][a.second];
		}
	}
	else {
		ans.emplace_back(n - 1);
		auto a = pre[1][n - 1];
		while (a != make_pair(-1, -1)) {
			if (a.first == 1) {
				ans.emplace_back(a.second);
			}
			a = pre[a.first][a.second];
		}
	}
	reverse(ALL(ans));
	REP(i, ans.size()) {
		if (i >= 1)cout << " ";
		cout << ans[i] + 1;
	}
	cout << endl;
	//system("pause");
}