#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#include <cassert>

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair


ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }

const ll MOD=1000000007LL;

ll ADD(ll x, ll y) { return (x+y) % MOD; }
ll SUB(ll x, ll y) { return (x-y+MOD) % MOD; }
ll MUL(ll x, ll y) { return x*y % MOD; }
ll POW(ll x, ll e) { ll v=1; for(; e; x=MUL(x,x), e>>=1) if (e&1) v = MUL(v,x); return v; }
ll DIV(ll x, ll y) { /*assert(y%MOD!=0);*/ return MUL(x, POW(y, MOD-2)); }

#define INTSPACE 12
char _buf[INTSPACE*1000000 + 3];

int loadint() {
    if (fgets(_buf, INTSPACE+3, stdin)==NULL) return 0;
    return atoi(_buf);
}

int loadvec(vector<ll>& v, int N=-1) {
    if (N == 0) {
        v.clear();
        return 0;
    }
    if (N == -1) {
        N = loadint();
        if (N==0) return 0;
    }
    int bufsize = INTSPACE*N + 3;
    if (fgets(_buf, bufsize, stdin)==NULL) return 0;
    v.resize(N);

    int i=0;
    bool last = false;
    for (char *p=&_buf[0]; ;) {
        char *q = p;
        while (*q > ' ') ++q;
        if (*q == 0x0D || *q == 0x0A) last = true;
        *q = 0;
        v[i++] = atoi(p);
        if (last || i == N) break;
        p = q+1;
    }
    return i;
}
void read_cr() {
    fgets(_buf, 256, stdin);
}


ll estim(vll& a, int ofs){
    int N = a.size();
    ll sum = 0;
    for(int i=ofs; i<N; i+=2){
        if (a[i] > 0) sum += a[i];
    }
    return sum;
}

const int INF = 0x7fffffff;

void sub(vi& killer) {
    int N = killer.size();
    assert(accumulate(ALL(killer),0) < N);

    vi ops;
    int left_x = 0, right_x = 0;
    for (int x=0; x<N; ++x) {
        if (killer[x]) left_x++;
        else break;
    }
    for (int x=N-1; x>=0; --x) {
        if (killer[x]) right_x++;
        else break;
    }

    rep(i, right_x) {
        ops.pb(N-1-i);
    }
    killer.erase(killer.begin()+N-right_x, killer.end());

    rep(i, left_x) {
        ops.pb(0);
    }
    killer.erase(killer.begin(), killer.begin()+left_x);

    N = killer.size();
    assert(killer[0] == 0 && killer[N-1] == 0);

    for (int i=0; i<N; ++i) {
        if (!killer[i]) { continue; }

        for (int j=i+1; j<N; ++j){
            if (killer[j]) continue;
            killer.erase(killer.begin()+i-1, killer.begin()+j);
            int w = j-i;
            N -= w+1;
            while (w > 1) {
                ops.pb(i+1);
                w -= 2;
            }
            assert(w == 1);
            ops.pb(i);
            break;
        }
        --i;
    }
    assert(N == 1);

    cout << ops.size() << endl;
    for (int ix : ops) {
        cout << 1+ix << endl;
    }
}

void solve(int N, vll& a) {
    vi killer(N, 1);

    ll peak = *max_element(ALL(a)), maxv;
    if (peak < 0) {
        int at = -1; rep(i,N) if (a[i] == peak) { at = i; break; }
        maxv = peak; killer[at] = 0;
    } else {
        ll e0 = estim(a, 0), e1 = estim(a, 1);
        if (e0 >= e1) {
            rep(i,N) if (i%2 == 0 && a[i] >= 0) killer[i] = 0;
            maxv = e0;
        } else {
            rep(i,N) if (i%2 == 1 && a[i] >= 0) killer[i] = 0;
            maxv = e1;
        }
    }

    cout << maxv << endl;
    sub(killer);
}
int main() {
    vll a;
    int N = loadvec(a);
    solve(N,a);
    return 0;
}


Measured memory_bytes: 256