//#include <bits/stdc++.h>
 
#include <iostream>
#include <algorithm>
 
#include <bitset>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <cstring>
#include <string>
#include <utility>
#include <array>
#include <complex>
#include <valarray>
 
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
 
 
using namespace std;
#define int long long
 
typedef long long ll;
typedef unsigned long long ull;
//typedef unsigned __int128 HASH;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll,int> plli;
typedef pair<double, int> pdbi;
typedef pair<int,pii> pipii;
typedef pair<ll,pll> plpll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpii;
typedef vector<vector<int>> mat;
 
#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n);i>0;i--)
#define rrep2(i,a,b) for (int i=(a);i>b;i--)
#define pb push_back
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
 
const ll hmod1 = 999999937;
const ll hmod2 = 1000000000 + 9;
const int INF = 1<<30;
const ll INFLL = 1LL<<62;
const double EPS = 1e-12;
const ll mod = 1000000000 + 7;
const int dx4[4] = {1, 0, -1, 0};
const int dy4[4] = {0, 1, 0, -1};
const int dx8[8] = {1, 1, 1, 0, 0, -1, -1, -1};
const int dy8[8] = {0, 1, -1, 1, -1, 0, 1, -1};
const double pi = 3.141592653589793;
 
#define addm(X, Y) (X) = ((X) + ((Y) % mod) + mod) % mod
#define inside(y, x, h, w) (0 <= (y) && (y) < (h) && 0 <= (x) && (x) < (w)) ? true : false
 
//debug
#define DEBUG 
 
#define DUMPOUT cout
 
#ifdef DEBUG
#define dump(...) DUMPOUT<<#__VA_ARGS__<<" :["<<__FUNCTION__<<":"<<__LINE__<<"]"<<endl; DUMPOUT<<"    "; dump_func(__VA_ARGS__)
#else
#define dump(...) 
#endif
 
void dump_func() {DUMPOUT << endl;};
 
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) == 0) DUMPOUT << " ";
    else DUMPOUT << ", ";
    dump_func(std::move(tail)...);
}
 
//ostream 
template<typename T> ostream& operator << (ostream& os, vector<T>& vec) {
    os << "["; for (int i = 0; i<vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : ", "); os << "]";
    return os;
}
 
template<typename T, typename U> ostream& operator << (ostream& os, pair<T, U>& pair_var) {
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}
 
template<typename T, typename U> ostream& operator << (ostream& os, map<T, U>& map_var) {
    os << "[";
    for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
        os << "(" << itr->first << ", " << itr->second << ")"; itr++;  if(itr != map_var.end()) os << ", "; itr--;
    }
    os << "]";
    return os;
}
 
template<typename T> ostream& operator << (ostream& os, set<T>& set_var) {
    os << "[";
    for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
        os << *itr; ++itr; if(itr != set_var.end()) os << ", "; itr--;
    }
    os << "]";
    return os;
}

int n;
int a[1005];
vector<pii> odd, even;

signed main() {	
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> n;
    if (n == 2) {
        cout << max(a[0], a[1]) << endl;
        cout << 1 << endl;
        if (a[0] >= a[1]) cout << 2 << endl;
        else cout << 1 << endl;
        return 0; 
    }
    if (n == 3) {
        cout << max({a[0], a[1], a[2], a[0] + a[2]});
        if (a[0] > a[0] + a[2]) {
            cout << 2 << endl;
            cout << 3 << endl;
            cout << 2 << endl;
        }
        else if (a[1] > a[0] + a[2]) {
            cout << 2 << endl;
            cout << 1 << endl;
            cout << 2 << endl;
        }
        else if (a[2] > a[0] + a[2]) {
            cout << 2 << endl;
            cout << 1 << endl;
            cout << 1 << endl;
        }
        else {
            cout << 1 << endl;
            cout << 2 << endl;
        }
        return 0;
    }
    rep(i, n) {
        cin >> a[i];
        if (i % 2 == 0) {
            even.push_back({a[i], i});
        }
        else {
            odd.push_back({a[i], i});
        }
    }
    sort(all(even));
    sort(all(odd));
    reverse(all(even));
    reverse(all(odd));
    vector<int> idx1, idx2;
    int score1 = 0;
    int score2 = 0;
    rep(i, even.size()) {
        if (even[i].fi <= 0) break;
        score1 += even[i].fi;
        idx1.push_back(even[i].se);
    } 
    rep(i, odd.size()) {
        if (odd[i].fi <= 0) break;
        score2 += odd[i].fi;
        idx2.push_back(odd[i].se);
    }
    if (odd[0].fi <= 0 && even[0].fi <= 0) {
        if (odd[0].fi <= even[0].fi) swap(odd, even);
        cout << odd[0].fi << endl;
        int idx = odd[0].se;
        cout << n - 1 << endl;
        rep(i, idx) cout << 1 << endl;
        n -= idx;
        int nown = n;
        rep(i, n - 1) {
            cout << nown << endl;
            nown--;
        }
        return 0;
    }
    if (score1 <= score2) swap(idx1, idx2);
    cout << max(score1, score2) << endl;

    vector<int> idx = idx1;
    sort(all(idx));
    //dump(idx);
    int m = idx.size();
    int cnt = idx[0] + (n - 1) - idx[m - 1];
    rep(i, m - 1) {
        int l = idx[i];
        int r = idx[i + 1];
        cnt += (r - l) / 2;
    }
    cout << cnt << endl;

    int nown = n;
    while (idx[0] > 0) {
        cout << 1 << endl;
        rep(j, m) {
            idx[j]--;
        }
        nown--;
    }
    while (nown - 1 > idx[m - 1]) {
        cout << nown << endl;
        nown--;
    }
    rep(i, m - 1) {
        int l = idx[i];
        int r = idx[i + 1];
        while (r - l >= 2) {
            cout << (r + l) / 2  + 1 << endl;
            r -= 2;
            rep2(j, i + 1, m) {
                idx[j] -= 2;
            }
        }
    }
}


Measured memory_bytes: 256