//Create Time: 2018-04-27 11:20:52
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <cstdlib>
#include <sstream>
#include <fstream>
#include <functional>
#include <list>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
#include <cctype>
#include <ctime>
#include <utility>
#include <complex>
#include <cassert>
#include <climits>
#include <iterator>
#include <tuple>
using namespace std;
#define snuke(i,x) for (__typeof((x).begin()) i = (x).begin(); i != (x).end(); ++i)
#define rep(i,a,n) for (int i=(a);i<(n);i++)
#define per(i,n,a) for (int i=(n)-1;i>=(a);i--)
// #define OUT(x) std::cout<<(#x)<<":"<<(x)<<std::endl
// #define TST(x) std::cout<<(#x)<<":"<<(x)<<" "
#define OUT(args...) {string _s=#args;replace(_s.begin(),_s.end(),',',' ');stringstream _ss(_s);istream_iterator<string> _it(_ss);OUT_TST("\n",_it,args);}
#define TST(args...) {string _s=#args;replace(_s.begin(),_s.end(),',',' ');stringstream _ss(_s);istream_iterator<string> _it(_ss);OUT_TST("",_it,args);}
#define SZ(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
#define unq(x) sort(all(x)),(x).erase(unique(all(x)),(x).end())
#define mem(f,x) memset((f), (x), sizeof(f))
#define clr(f) mem(f,0)
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define mt make_tuple
#define eb emplace_back
#define DEBUG
void OUT_TST(string s,istream_iterator<string> it) {cerr<<s;}
template<typename T, typename... Args> void OUT_TST(string s,istream_iterator<string> it,T a,Args... args){cerr<<*it<<"="<<a<<" ";OUT_TST(s,++it,args...);}
template<class T> void rd(T&ret){ret=0;bool ok=0,u=0;for(;;){int c=getchar();if(c>='0'&&c<='9')ret=(ret<<3)+(ret<<1)+c-'0',ok=1;else if(c=='-')u=1;else if(ok){if(u)ret*=-1;return;}}}
long long powmod(long long p,long long n,long long mod){long long ret=1;for(;n;n>>=1){if(n&1)ret=ret*p%mod;p=p*p%mod;}return ret;}
template <class T> bool chmin(T& a, const T &b) {return b < a? a = b, 1: 0;}
template <class T> bool chmax(T& a, const T &b) {return b > a? a = b, 1: 0;}
int gcd(int a,int b){return b?gcd(b,a%b):a;}
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii > vii;
typedef tuple<int,int,int> tp;
/****head****/
ll d[1111][1111];
int an[1111];
int main(){
    int n;scanf("%d",&n);
    rep(i,0,n)scanf("%d",an+i);
    rep(i,0,n)d[i][i]=an[i];
    for(int l=3;l<=n;l+=2){
        for(int i=0,j=l-1;j<n;++i,++j){
            d[i][j]=max(d[i+2][j],d[i][j-2]);
            chmax(d[i][j],d[i+2][j]+d[i][i]);
            chmax(d[i][j],d[i][j-2]+d[j][j]);
        }
    }
    ll ans=d[0][0];
    pii pos={0,0};
    rep(i,0,n)rep(j,i,n)if(((j-i+1)&1) && chmax(ans,d[i][j]))pos={i,j};
    vi pnt;
    int x,y;tie(x,y)=pos;
    OUT(x,y,ans);
    while(1){
        if(x==y){pnt.pb(x);break;}
        if(d[x][y]==d[x+2][y]+d[x][x])pnt.pb(x);
        x+=2;
    }
    // for(int i:pnt)TST(i);puts("");
    vector<int> pn;
    int l=n;
    rep(i,0,pnt[0])pn.pb(0),--l;
    per(i,n,pnt.back()+1)pn.pb(--l);
    rep(i,0,SZ(pnt)-1){
        int tl=pnt[i+1]-pnt[i]-1;
        while(tl>1){
            pn.pb(2);
            tl-=2;
        }
        pn.pb(1);
    }
    cout<<ans<<endl;
    printf("%d\n",SZ(pn));
    for(int i:pn)printf("%d\n",i+1);
    return 0;
}


Measured memory_bytes: 8704