#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (Y)-1;(X) >= (S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class T,size_t n> ostream& operator<<(ostream &os, const array<T,n> &t) {
	os<<"{"; rep(i,n) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class S, class T,class U> ostream& operator<<(ostream &os, const tuple<S,T,U> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class S, class T,class U,class V> ostream& operator<<(ostream &os, const tuple<S,T,U,V> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<","<<get<3>(t)<<")";}
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
//#undef NUIP
#ifdef NUIP
#define out(args...){vector<string> a_r_g_s=s_p_l_i_t(#args, ','); e_r_r(a_r_g_s.begin(), args); }
vector<string> s_p_l_i_t(const string &s, char c){vector<string> v;int d=0,f=0;string t;for(char c:s){if(!d&&c==',')v.pb(t),t="";else t+=c;if(c=='\"'||c=='\'')f^=1;if(!f&&c=='(')++d;if(!f&&c==')')--d;}v.pb(t);return move(v);}
void e_r_r(vector<string>::iterator it) {}
template<typename T, typename... Args> void e_r_r(vector<string>::iterator it, T a, Args... args){ if(*it==" 1"||*it=="1") cerr<<endl; else cerr << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << ", "; e_r_r(++it, args...);}
#else
#define out
#endif
template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}
template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}
const ll MOD=1e9+7;
const ll INF=1e15;
int prv[1123];
ll mx[1123];

int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
	fill(mx,mx+1123,-INF);
	int n;
	cin>>n;
	vector<int> a(n);
	rep(i,n) cin>>a[i];
	mx[0]=0;
	mx[1]=a[0];
	rep(i,n) mx[i+1]=a[i];
	rep(i,n){
		for(int j=i+2;j<=n;j+=2)if(MX(mx[j], mx[i]+a[j-1])) prv[j]=i;
	}
	//rep(i,n+1) cout<<mx[i]<<",";cout<<endl;
	ll last=n,re=mx[n];
	for(int i=n-1;i>0;i-=1)if(MX(re,mx[i])) last=i;
	out(re,last,1);
	int len=n;
	vector<int> ope;
	auto pop=[&](int t){
		rep(_,t){
			ope.pb(len);
			len-=1;
		}
	};
	auto merge=[&](int t){
		for(;t>1;t-=2){
			ope.pb(len-2);
			len-=2;
		}
		ope.pb(len-1);
		len-=2;
	};
	pop(n-last);
	out(ope,1);
	while(1){
		if(last<=1) break;
		int nxt=prv[last];
		if(nxt==0){
			rep(_,last-1) ope.pb(1);
			break;
		}
		merge(last-nxt-1);
		last=nxt;
		out(last,1);
	}
	out(ope,1);
	cout<<re<<endl;
	cout<<ope.size()<<endl;
	for(int x:ope) cout<<x<<endl;
  return 0;
}


Measured memory_bytes: 256