#include <bits/stdc++.h>

using namespace std;

const int N = 1e3 + 5;

int n, a[N], f[N][2], ans[N], cnt;

int main()
{
	cin >> n;
	for (int i = 1; i <= n; i ++ ) cin >> a[i];
	for (int i = 1; i <= n; i ++ ) f[i][0] = max(f[i - 1][0], f[i - 1][1]), f[i][1] = f[i - 1][0] + a[i];
	cout << max(f[n][0], f[n][1]) << endl;
	int x = 0, y = 0;
	if (f[n][0] > f[n][1]) x = n, y = 0;
	else x = n, y = 1;
	while (x)
	{
		if (y == 0)
		{
			if (f[x - 1][0] > f[x - 1][1]) x -- , y = 0;
			else x -- , y = 1;
		}
		else ans[ ++ cnt] = x, x -- , y = 0;
	}
	for (int i = cnt; i >= 1; i -- ) cout << ans[i] << " ";
	return 0;
}