#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>

#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<functional>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define INF 1<<30
#define MP make_pair
#define mp make_pair
#define pb push_back
#define PB push_back
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define ll long long
#define ull unsigned long long

int dp[1010];
int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	int n;cin>>n;
	int w[n];
	REP(i,n) cin>>w[i];
	dp[1]=w[0];
	FOR(i,2,n+1){
		dp[i] = max(dp[i-1],dp[i-2]+w[i-1]); 
	}
	cout<<dp[n]<<endl;
	vector<int> p;
	int tmp=n;
	while(tmp>0){
		if(tmp==1){p.pb(tmp);break;}
 		if(dp[tmp] == dp[tmp-1]){tmp--;}
 		else if(tmp >=2 && dp[tmp] == dp[tmp-2]+w[tmp-1]) {
			p.pb(tmp);
			tmp-=2;
		}
 	}
 	reverse(p.begin(),p.end());
 	REP(i,p.size()) cout<<p[i]<<" ";
	cout<<endl;
}