#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 1987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };

ll c[2];
int n;
int main(){
	scanf("%d",&n);
	VPll p(n);
	int mx=-INF,w=-1;
	fup(i,0,n-1,1)
	{
		scanf("%lld",&p[i].X);
		if(p[i].X>0)c[i&1]+=p[i].X;
		p[i].Y=i&1;
		if(mx<p[i].X)
		{
			mx=p[i].X;
			w=i;
		}
	}
	if(mx<=0)
	{
		printf("%d\n",mx);
		printf("%d\n",n-1);
		fdn(i,n,w+2,1)printf("%d\n",i);
		fup(i,0,w-1,1)printf("%d\n",1);
		return 0;
	}
	Vi ans;
	if(c[0]>c[1])
	{
		printf("%lld\n",c[0]);
		while(p.size()>1)
		{
			VPll tmp;
			int N=p.size();
			bool ok=0;
			fup(i,0,N-1,1)
			{
				if(!ok && p[i].Y==0 && p[i].X<=0)
				{
					ok=1;
					ans.pb(i+1);
					if(i!=0 && i!=N-1)
					{
						tmp.pop_back();
						tmp.pb(mp(p[i-1].X+p[i+1].X,p[i-1].Y));
						i++;
					}
				}
				else tmp.pb(p[i]);
			}
			if(ok)
			{
				p=tmp;
				continue;
			}
			tmp.clear();
			fup(i,0,N-1,1)
			{
				if(!ok && p[i].Y==1)
				{
					ok=1;
					ans.pb(i+1);
					if(i!=0 && i!=N-1)
					{
						tmp.pop_back();
						tmp.pb(mp(p[i-1].X+p[i+1].X,p[i-1].Y));
						i++;
					}
				}
				else tmp.pb(p[i]);
			}
			p=tmp;
		}
	}
	else
	{
		printf("%lld\n",c[1]);
		while(p.size()>1)
		{
			VPll tmp;
			int N=p.size();
			bool ok=0;
			fup(i,0,N-1,1)
			{
				if(!ok && p[i].Y==1 && p[i].X<=0)
				{
					ok=1;
					ans.pb(i+1);
					if(i!=0 && i!=N-1)
					{
						tmp.pop_back();
						tmp.pb(mp(p[i-1].X+p[i+1].X,p[i-1].Y));
						i++;
					}
				}
				else tmp.pb(p[i]);
			}
			if(ok)
			{
				p=tmp;
				continue;
			}
			tmp.clear();
			fup(i,0,N-1,1)
			{
				if(!ok && p[i].Y==0)
				{
					ok=1;
					ans.pb(i+1);
					if(i!=0 && i!=N-1)
					{
						tmp.pop_back();
						tmp.pb(mp(p[i-1].X+p[i+1].X,p[i-1].Y));
						i++;
					}
				}
				else tmp.pb(p[i]);
			}
			p=tmp;
		}
	}
	printf("%d\n",ans.size());
	for(int x:ans)printf("%d\n",x);
}

Measured memory_bytes: 256