#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <list>
#include <tuple>
#include <bitset>
#include <ciso646>

using namespace std;

inline bool cheak(int x, int y, int xMax, int yMax){ return x >= 0 && y >= 0 && xMax > x && yMax > y; }
inline int toInt(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
template<class T> inline T sqr(T x) { return x*x; }

typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef long long ll;
typedef unsigned long long ull;

#define For(i,a,b)	for(int (i) = (a);i < (b);(i)++)
#define rep(i,n)	For(i,0,n)
#define clr(a)		memset((a), 0 ,sizeof(a))
#define mclr(a)		memset((a), -1 ,sizeof(a))
#define all(a)		(a).begin(),(a).end()
#define sz(a)		(sizeof(a))
#define Fill(a,v)	fill((int*)a,(int*)(a+(sz(a)/sz(*(a)))),v)

const int dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 }, dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const int mod = 1000000007;
const int INF = 1e9;

int dp[1001];
vector<vector<int>> av;

int main()
{
	int n;
	cin >> n;
	vector<int> v;
	int ans = 0;
	vector<int> ans_v;

	rep(i, n){
		int t;
		cin >> t;
		v.push_back(t);
		dp[i] = t;
		if (ans < t){
			ans = t;
			ans_v = vector<int>(1, i + 1);
		}
		av.push_back(vector<int>(1, i+1));
	}
	rep(i, n)if (dp[i] != -1){
		For(j, i + 2, n){

			if (dp[j] < dp[i] + v[j]){
				dp[j] = dp[i] + v[j];
				av[j] = av[i];
				av[j].push_back(j+1);
			}
			if (ans < dp[j]){
				ans_v = av[j];
				ans = dp[j];
			}
		}
	}
	cout << ans << endl;
	for (auto i : ans_v)cout << i << " ";
	cout << endl;
	return 0;
}