#include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using ll=long long;
using vi=vector<int>;
using pii=pair<int,int>;
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)
#define ITR(i,b,e) for(auto i=(b);i!=(e);++i)
#define FORE(x,c) for(auto &x:c)
#define REPF(i,a,n) for(int i=a,i##len=(int)(n);i<i##len;++i)
#define REP(i,n) REPF(i,0,n)
#define REPR(i,n) for(int i=(int)(n);i>=0;--i)
#define SZ(c) ((int)c.size())
#define CONTAIN(c,x) (c.find(x)!=end(c))
#define OUTOFRANGE(y,x,h,w) ((y)<0||(x)<0||(y)>=(h)||(x)>=(w))
#define dump(...)
const signed INF_=1001001001; const ll INF=1001001001001001001LL;
const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0};
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) {
    ITR(i,begin(v),end(v))os<<*i<<(i==end(v)-1?"":"\n");return os;}
template<class T> istream& operator>>(istream &is,vector<T> &v) {
    ITR(i,begin(v),end(v)) is>>*i;return is;}
template<class T,class U> istream& operator>>(istream &is, pair<T,U> &p) {
    is>>p.first>>p.second;return is;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}return 0;}
template<class T> using heap=priority_queue<T,vector<T>,greater<T>>;
struct{template<class T> operator T(){T x;cin>>x;return x;}} IN;
struct before_main_function {
    before_main_function() {
        cin.tie(0);ios::sync_with_stdio(false);
        cout<<setprecision(15)<<fixed;
        #define endl "\n"
    }
} before_main_function;
//------------------8<------------------------------------8<--------------------

signed main() {
    int n;
    cin >> n;
    vector<int> a(n);
    cin >> a;
    bool negative = true;
    REP(i, n) if (a[i] >= 0) negative = false;
    deque<bool> use(n, false);
    int mx = -INF;
    if (negative) {
        mx = (*max_element(ALL(a)));
        REP(i, n) {
            if (a[i] == mx) {
                use[i] = true;
                break;
            }
        }
    } else {
        int odd = 0, even = 0;
        REP(i, n) {
            if (a[i] >= 0) {
                if (i % 2) odd += a[i];
                else even += a[i];
            }
        }
        REP(i, n) {
            if (a[i] >= 0) {
                if (i % 2 && odd > even) use[i] = 1;
                if (!(i % 2) && odd <= even) use[i] = 1;
            }
        }
        mx = max(odd, even);
    }

    vector<int> ans;
    while (!use.front()) ans.push_back(1), use.pop_front();
    while (!use.back()) ans.push_back(SZ(use)), use.pop_back();
    while (use.size() > 1) {
        ITR(itr, begin(use) + 1, end(use) - 1) {
            if (*prev(itr) && !*itr && *next(itr)) {
                int idx = distance(begin(use), itr);
                ans.push_back(idx + 1);
                itr--;
                itr = use.erase(itr);
                *itr = true;
                itr++;
                itr = use.erase(itr);
                break;
            }
            if (!*prev(itr) && !*itr && !*next(itr)) {
                int idx = distance(begin(use), itr);
                ans.push_back(idx + 1);
                itr--;
                itr = use.erase(itr);
                *itr = false;
                itr++;
                itr = use.erase(itr);
                break;
            }
        }
    }

    cout << mx << endl;
    cout << SZ(ans) << endl;
    cout << ans << endl;
    return 0;
}



Measured memory_bytes: 256