#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#include <iomanip>
#include <complex>
#include <bitset>

using namespace std;

#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f3f3f3f3fLL
#define SIZE 8080
#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()

typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
typedef pair<int,ll> pill; typedef pair<ll,int> plli; 
typedef pair<double, int> pdi;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }
typedef complex<double> P;
ll MOD=1e9+7;
typedef ll Weight;
struct Edge {
	int src, dst;
	Weight weight;
};
bool operator < (const Edge &e, const Edge &f) {
	return e.weight != f.weight ? e.weight > f.weight : // !!INVERSE!!
	e.src != f.src ? e.src < f.src : e.dst < f.dst;
}
typedef vector<Edge> Edges;
typedef vector<Edges> Graph;

int N,M;
vi Gr[105];

int main(){
	cin>>N;
	vector<ll> A(N);
	for(int i=0;i<N;i++){
		cin>>A[i];
	}
	vi pos_ev,pos_odd;
	vi X,Y;
	int pos=0;
	ll sum_ev=0,sum_odd=0;
	ll ma=A[0];
	int mi_ev = N,mi_odd=N;
	for(int i=0;i<N;i++){
		if(ma<A[i])ma=A[i],pos=i;
		if(i%2 == 0){
			if(A[i]>=0){
				sum_ev += A[i];
				//mi_ev=min(mi_ev,i);
				X.pb(i);//つかう
			}else{
				pos_ev.pb(i);//つかわない
			}
		}else{
			if(A[i]>=0){
				sum_odd += A[i];
				//mi_odd=min(mi_odd,i);
				Y.pb(i);
			}else{
				pos_odd.pb(i);
			}
		}
	}
	int lef,rig;
	vi ans;
	if(ma<0){
		cout<<ma<<endl;
		pos++;
		for(int i=N;i>pos;i--){
			//cout<<i<<endl;
			ans.pb(i);
		}
		for(int i=0;i<pos-1;i++){
			//cout<<1<<endl;
			ans.pb(1);
		}
	}else if(sum_ev>sum_odd){
		cout<<sum_ev<<endl;
		lef=X[0];
		rig=X[X.size()-1];
		lef++;rig++;
		//cout<<lef<<" "<<rig<<endl;
		for(int i=N;i>rig;i--){
			//cout<<i<<endl;
			ans.pb(i);
		}
		for(int i=pos_ev.size()-1;i>=0;i--){
			int p=pos_ev[i]+1;
			if(p>=lef&&p<=rig)ans.pb(p);
		}
		for(int i=0;i<lef-1;i++){
			//cout<<1<<endl;
			ans.pb(1);
		}
		for(int i=0;i<X.size()-1;i++){
			//cout<<2<<endl;
			ans.pb(2);
		}
	}else{
		cout<<sum_odd<<endl;
		
		lef=Y[0];
		rig=Y[Y.size()-1];
		lef++;rig++;
		//cout<<lef<<" "<<rig<<endl;
		for(int i=N;i>rig;i--){
			//cout<<i<<endl;
			ans.pb(i);
		}
		for(int i=pos_odd.size()-1;i>=0;i--){
			int p=pos_odd[i]+1;
			if(p>=lef&&p<=rig)ans.pb(p);
			//cout<<p<<endl;
		}
		for(int i=0;i<lef-1;i++){
			//cout<<1<<endl;
			ans.pb(1);
		}
		for(int i=0;i<Y.size()-1;i++){
			//cout<<2<<endl;
			ans.pb(2);
		}
	}
	
	cout<<ans.size()<<endl;
	for(int i=0;i<ans.size();i++)cout<<ans[i]<<endl;
}

Measured memory_bytes: 256