/**
 *    author:  otera    
**/
#include<iostream>
#include<string> 
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm> 
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;

#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x)  cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

vector<int> num(int co) {
    vector<int> res;
    for(int j = co - 2; j >= 2; j -= 2) {
        res.push_back(j);
    }
    res.push_back(1);
    return res;
}

void solve() {
	int n; cin >> n;
    vector<int> a(n);
    int ma = -INF;
    rep(i, n) {
        cin >> a[i];
        chmax(ma, a[i]);
    }
    if(ma <= 0) {
        cout << ma << endl;
        cout << n - 1 << endl;
        int j = -1;
        rep(i, n) if(a[i] == ma) j = i;
        for(int i = n - 1; i > j; -- i) cout << i + 1 << endl;
        for(int i = 0; i < j; ++ i) cout << 1 << endl;
        return;
    }
    static int dp[1010];
    vector<int> prev(n + 1, -1);
    rep(i, 1010) {
        dp[i] = 0;
    }
    rep(i, n) {
        dp[i + 1] = a[i];
        for(int j = i - 1; j >= 0; j -= 2) {
            if(chmax(dp[i + 1], dp[j] + a[i])) {
                prev[i + 1] = j;
            }
        }
    }
    int res = 0, k = -1;
    for(int i = 1; i <= n; ++ i) {
        if(chmax(res, dp[i])) {
            k = i;
        }
    }
    cout << res << endl;
    static bool pos[1010];
    vector<int> b;
    rep(i, 1010) pos[i] = 0;
    int cur = k;
    b.push_back(cur - 1);
    pos[cur] = 1;
    while(prev[cur] != -1) {
        cur = prev[cur];
        pos[cur] = 1;
        b.push_back(cur - 1);
    }
    reverse(all(b));
    vector<int> op;
    int sz = (int)b.size();
    // rep(i, sz) cerr << b[i] << " ";
    // cerr << endl;
    for(int j = n - 1; j > b[sz - 1]; -- j) {
        op.push_back(j);
    }
    for(int i = sz - 1; i >= 1; -- i) {
        int co = b[i] - b[i - 1];
        for(int x: num(co)) {
            op.push_back(b[i - 1] + x);
        }
    }
    for(int i = 0; i < b[0]; ++ i) {
        op.push_back(0);
    }
    cout << (int)op.size() << endl;
    rep(i, (int)op.size()) {
        cout << op[i] + 1 << endl;
    }
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//int t; cin >> t; rep(i, t)solve();
	solve();
    return 0;
}

Measured memory_bytes: 3704