# include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); };
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); };
const int vy[] = { -1, -1, -1, 0, 1, 1, 1, 0 }, vx[] = { -1, 0, 1, 1, 1, 0, -1, -1 };
const int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(LL n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(LL n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
LL gcd(LL a, LL b) { if (b == 0)return a; return gcd(b, a%b); };
LL lcm(LL a, LL b) { LL g = gcd(a, b); return a / g*b; };
# define ALL(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        sort(ALL((wpwpw)));(wpwpw).erase(unique(ALL((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(ALL((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(ALL((rprpr)),(rprpr).begin(),TU<char>)
# define FOR(i,tptpt,ypypy)   for(LL i=(tptpt);i<(ypypy);i++)
# define REP(i,upupu)         FOR(i,0,upupu)

struct INIT{
    INIT(){
        std::ios::sync_with_stdio(false);
        std::cin.tie(0);
        cout << fixed << setprecision(13);
    }
}INIT;

int n;
LL a[1010], after_a[1010];
LL sum_odd, sum_even;

int main(){
    cin >> n;
    REP(i, n)cin >> a[i];
    REP(i, n){
        if(a[i] > 0)(i % 2 ? sum_odd : sum_even) += a[i];
    }
    int sz = n;
    vector<int> ans;

    if(sum_odd == 0 && sum_even == 0){
        LL maxl = -HINF<LL>(), maxpos = -1;
        REP(i, n){
            if(maxl < a[i]){
                maxl = a[i];
                maxpos = i;
            }
        }
        cout << maxl << endl;
        cout << n - 1 << endl;
        REP(i, maxpos)cout << 1 << endl, sz--;
        REP(i, n - maxpos - 1)cout << sz << endl, sz--;
        return 0;
    }

    if(sum_odd < sum_even){
        cout << sum_even << endl;
    }else{
        cout << sum_odd << endl;
        ans.emplace_back(1);
        for(int i = 1;i < sz;i++){
            a[i - 1] = a[i];
        }
        sz--;
    }
    while(sz > 1){
        if(sz >= 2 && a[0] < 0){
            ans.emplace_back(1);
            for(int i = 1;i < sz;i++){
                a[i - 1] = a[i];
            }
            sz--;
            ans.emplace_back(1);
            for(int i = 1;i < sz;i++){
                a[i - 1] = a[i];
            }
            sz--;
        }else if(sz >= 4 && a[0] > 0 && a[2] < 0){
            ans.emplace_back(3);
            a[1] = a[1] + a[3];
            for(int i = 4;i < sz;i++){
                a[i - 2] = a[i];
            }
            sz -= 2;
        }else if(sz >= 3 && a[0] > 0 && a[2] > 0){
            ans.emplace_back(2);
            for(int i = 3;i < sz;i++){
                a[i - 2] = a[i];
            }
            sz -= 2;
        }else{
            ans.emplace_back(sz);
            sz--;
        }
    }
    cout << (int)ans.size() << endl;
    REP(i, (int)ans.size()){
        cout << ans[i] << endl;
    }
}

Measured memory_bytes: 256