// g++ -std=c++11 a.cpp
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#include<typeinfo>
#define loop(i,a,b) for(int i=a;i<b;i++)
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
//#define int ll
typedef ll Def;
typedef pair<Def,Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def,pii> pip;
typedef vector<pip>vip;
//#define mt make_tuple
//typedef tuple<int,int,int> tp;
//typedef vector<tp> vt;
template<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}
template<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}
//template<class C>constexpr int size(const C &c){return (int)c.size();}
//template<class T,size_t N> constexpr int size(const T (&xs)[N])noexcept{return (int)N;}
const double PI=acos(-1);
const double EPS=1e-9;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9+10;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
int main(){
    freopen(".57.in","r",stdin);
    freopen(".57.out","w",stdout);
	int n;
	cin>>n;
	vi in(n);
	rep(i,n)cin>>in[i];

	vi dp(n),f(n);
	ll ma=-inf,mai;
	rep(i,n){
		dp[i]=in[i];
		f[i]=i;
		rep(j,i)if((i-j)%2==0){
			if(dp[i]<dp[j]+in[i]){
				dp[i]=dp[j]+in[i];
				f[i]=j;
			}
		}
		if(ma<dp[i]){
			ma=dp[i];
			mai=i;
		}
	}
	cout<<ma<<endl;
	vi out;
	rep(i,n-mai-1)out.pb(n-i);
	while(f[mai]-mai){
		int t=f[mai];
		while(mai-t!=2){
			out.pb(t+3);
			mai-=2;
		}
		out.pb(t+2);
		mai-=2;
	}
	rep(i,mai)out.pb(1);

	//cout<<out.size()<<endl;
	//rep(i,out.size())cout<<out[i]<<endl;
}