#include<sstream>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())
#define indexOf(v,x) (find(all(v),x)-v.begin())


int dp[1001][2];

int main(){
	int v[1000];
	int n;
	cin>>n;
	rep(i,n)cin>>v[i];
	rep(i,n){
		dp[i+1][1]=dp[i][0]+v[i];//eat
		dp[i+1][0]=max(dp[i][0],dp[i][1]);
	}

	vector<int> ans;
	int s=0;
	if(dp[n][0]<dp[n][1])s=1;

	for(int i=n;i>0;i--){
		if(s==1){
			ans.push_back(i);
			s=0;
		}else{
			if(dp[i][0]==dp[i-1][1])s=1;
		}
	}
	reverse(all(ans));
	cout<<max(dp[n][0],dp[n][1])<<endl;
	rep(i,ans.size()){
		if(i)cout<<' ';
		cout<<ans[i];
	}cout<<endl;
	return 0;
}