#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<to;x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N;
int V[1010];
int ma[2020];
int from[2020];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	FOR(i,N) cin>>V[i+2];
	for(i=2;i<N+2;i++) {
		FOR(x,i-1) {
			if(ma[i]<ma[x]+V[i]) {
				ma[i]=ma[x]+V[i];
				from[i]=x;
			}
		}
	}
	int id=0;
	FOR(i,N+2) if(ma[i]>ma[id]) id=i;
	_P("%d\n",ma[id]);
	vector<int> V;
	while(id>=2) {
		V.push_back(id-1);
		id=from[id];
	}
	reverse(ALL(V));
	FOR(i,V.size()) _P("%d%c",V[i],(i==V.size()-1)?'\n':' ');
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false);
	FOR(i,argc-1) s+=argv[i+1],s+='\n';
	FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	solve(); return 0;
}