#include <bits/stdc++.h>
using namespace std;

int n;
int v[1000];

int dp[1010];
int pv[1010];

int main()
{
	cin >> n;
	for (int i = 0; i < n; i++){
		cin >> v[i];
	}

	memset(pv, -1, sizeof(pv));
	for (int i = 0; i < n; i++){
		dp[i] = v[i];
		for (int j = 0; j < i - 1; j++){
			if (dp[i] < dp[j] + v[i]){
				dp[i] = dp[j] + v[i];
				pv[i] = j;
			}
		}
	}

	int p = max_element(dp, dp + n) - dp;
	cout << dp[p] << endl;
	
	vector<int> res;
	do {
		res.push_back(p + 1);
		p = pv[p];
	} while (~p);

	reverse(begin(res), end(res));

	for (int i = 0; i < res.size(); i++){
		cout << res[i] << "\n "[i < res.size() - 1];
	}
}