#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair<ll,ll> P;
 
long long int INF = 3e18;
double Pi = 3.1415926535897932384626;
 
vector<ll> G1[500005];
vector<ll> G2[500005];
//vector<P> tree[500010];
priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll,vector<ll>,greater<ll> > pqls;
priority_queue <P,vector<P>,greater<P> > pqps;
//small priority queue
//top pop
 
int dx[8]={1,0,-1,0,1,1,-1,-1};
int dy[8]={0,1,0,-1,1,-1,-1,1};
char dir[] = "DRUL";
//ll bit[500005];
//↓,→,↑,←
 
 
#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<(x)<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
 
 
ll mod = 1000000007;
ll rui(ll number1,ll number2){
 
    if(number2 == 0){
        return 1;
    }else{
        ll number3 = rui(number1,number2 / 2);
        number3 *= number3;
        number3 %= mod;
        if(number2%2==1){
            number3 *= number1;
            number3 %= mod;
        }
        return number3;
    }
}
ll gcd(ll number1,ll number2){
 
    if(number1 > number2){
        swap(number1,number2);
    }
    if(number1 == 0 || number1 == number2){
        return number2;
    }else{
        return gcd(number2 % number1,number1);
    }
}
void YES(bool condition){
 
    if(condition){
        p("YES");
    }else{
        p("NO");
    }
    return;
}
void Yes(bool condition){
 
    if(condition){
        p("Yes");
    }else{
        p("No");
    }
    return;
}

 
//ll fact[800005],rfact[800005];
/*
void c3_init(){
    fact[0] = rfact[0] = 1;
    for(ll i=1; i<=800000; i++){
        fact[i] = (fact[i-1]*i) % mod;
    }
    rfact[800000] = rui(fact[800000],mod - 2);
    for(ll i=800000; i>=1; i--){
       rfact[i-1] = rfact[i] * i;
       rfact[i-1] %= mod;
    }
    return;}
ll c3(ll n,ll r){
    return (((fact[n] * rfact[r]) % mod) * rfact[n-r]) % mod;}
*/
 
ll n,m,num,sum,ans,a,b,c,e,g,h,w,i,j,k,q;
ll x[500005],y[500005],z[500005];
ll table[500005];
ll table_num;
ll dp[100005];
bool dame;

void table_push(ll idx){
    table[table_num] = idx;
    table_num++;
    return;
}

void mattan(ll idx){
    for(int i=n;i>idx;i--){
        table_push(i);
    }
    return;
}

void sitan(ll idx){
    for(int i=idx-1;i>0;i--){
        table_push(1);
    }
    return;
}

void solve(ll i){
    if(dp[i] == x[i]){
        sitan(i);
        return;
    }else{
        for(int k=2;i-k>=0;k+=2){
            if(dp[i-k] + x[i] == dp[i]){
                ll point = (i - k / 2);
                for(int j=point;j>i-k;j--){
                    table_push(j);
                }
                solve(i-k);
                return;
            }
        }
    }
}

void corner(){
    num = -INF;
    ll idx = -1;
    for(i=1;i<=n;i++){
        if(num < x[i]){
            num = x[i];
            idx = i;
        }
    }
    mattan(idx);
    sitan(idx);
    p(num);
    p(table_num);
    for(i=0;i<table_num;i++){
        p(table[i]);
    }
    return;
}

int main(){
    cin >> n;
    bool allneg = true;
    for(i=1;i<=n;i++){
        cin >> x[i];
        if(x[i] > 0)allneg = false;
    }
    if(allneg){
        corner();
        return 0;
    }
    dp[0] = 0;
    for(i=1;i<=n;i++){
        //dp[i]の値を更新
        dp[i] = x[i];
        for(k=2;i-k>=0;k+=2){
            dp[i] = max(dp[i],dp[i-k] + x[i]);
        }
    }
    ans = -1;
    for(i=0;i<=n;i++){
        ans = max(ans,dp[i]);
    }
    p(ans);
    for(i=n;i>=0;i--){
        if(dp[i] == ans){
            mattan(i);
            solve(i);
        }
    }
    p(table_num);
    for(i=0;i<table_num;i++){
        p(table[i]);
    }



    
    return 0;
}












Measured memory_bytes: 25728