#include <iostream>
using namespace std;
typedef long long ll;

int main()
{
    int n;
    cin >> n;
    ll a[1003];
    ll s[2]{0};
    for(int i = 0; i < n; i++){
        cin >> a[i];
        if(a[i] > 0) s[i % 2] += a[i];
    }
    int j;
    if(s[0] > s[1]) j = 0;
    else j = 1;
    int l = n, r = -1;
    for(int i = 0; i < n; i++){
        if(i % 2 == j % 2 && a[i] > 0){
            l = min(l, i);
            r = max(r, i);
        }
    }
    if(l > r){
        int m = 0;
        for(int i = 1; i < n; i++){
            if(a[i] > a[m]) m = i;
        }
        cout << a[m] << endl;
        cout << n - 1 << endl;
        for(int i = n - 1; i > m; i--) cout << i + 1 << endl;
        for(int i = 0; i < m; i++) cout << 1 << endl;
        return 0;
    }
    cout << max(s[0], s[1]) << endl;
    cout << (r - l) / 2 + (n - 1) - r + l << endl;
    for(int i = n - 1; i > r; i--) cout << i + 1 << endl;
    int q = r;
    while(q != l){
        int p;
        for(p = q - 2; p >= 0; p -= 2){
            if(a[p] > 0) break;
        }
        for(int i = (q + p) / 2; i > p; i--) cout << i + 1 << endl;
        q = p;
    }
    for(int i = 0; i < l; i++) cout << 1 << endl;
}