#include <bits/stdc++.h>

using namespace std;

#define int long long
// #define double long double
#define FOR(i, a, b) for(ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for(ll i = (a); i > (b); --i)
#define REP(i, n) for(ll i = 0; i < (n); ++i)
#define REPR(i, n) for(ll i = n; i >= 0; i--)
#define FOREACH(x, a) for(auto &(x) : (a))
#define VECCIN(x)                                                              \
    for(auto &youso_ : (x)) cin >> youso_
#define bitcnt(x) __builtin_popcount(x)
#define lbit(x) __builtin_ffsll(x)
#define rbit(x) __builtin_clzll(x)
#define SZ(x) ((ll)(x).size())
#define fi first
#define se second
#define All(a) (a).begin(), (a).end()
#define rAll(a) (a).rbegin(), (a).rend()

template <typename T = long long> inline T IN() {
    T x;
    cin >> x;
    return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&... tail) {
    cin >> head;
    CIN(move(tail)...);
}
#define CCIN(...)                                                              \
    char __VA_ARGS__;                                                          \
    CIN(__VA_ARGS__)
#define DCIN(...)                                                              \
    double __VA_ARGS__;                                                        \
    CIN(__VA_ARGS__)
#define LCIN(...)                                                              \
    ll __VA_ARGS__;                                                            \
    CIN(__VA_ARGS__)
#define SCIN(...)                                                              \
    string __VA_ARGS__;                                                        \
    CIN(__VA_ARGS__)
#define Yes(a) cout << (a ? "Yes" : "No") << "\n"
#define YES(a) cout << (a ? "YES" : "NO") << "\n"
#define Printv(v)                                                              \
    {                                                                          \
        FOREACH(x, v) { cout << x << " "; }                                    \
        cout << "\n";                                                          \
    }
template <typename T = string> inline void eputs(T s) {
    cout << s << "\n";
    exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
    std::fill((T *)array, (T *)(array + N), val);
}

template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using PQ = priority_queue<T>;

typedef long long ll;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<ll, ll> PL;
typedef vector<PL> VPL;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<string> VS;

const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
const ll LINF = 1e18;
// const double PI = atan(1.0) * 4.0;
const ll dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
#define PI 3.141592653589793238

#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)

signed main() {
    ll n;
    cin >> n;
    vector<ll> a(n);
    vector<ll> od, ev;
    ll aod = 0, aev = 0;
    rep(i, n) {
        cin >> a[i];
        if(i % 2 && a[i] >= 0) {
            od.push_back(i);
            aod += a[i];
        } else if(a[i] >= 0) {
            ev.push_back(i);
            aev += a[i];
        }
    }
    vector<ll> b;
    if(od.size() == 0 && ev.size() == 0) {
        ll mx = -1e+10;
        ll it;
        rep(i, n) if(mx < a[i]) {
            it = i;
            mx = a[i];
        }
        cout << mx << endl;
        b.push_back(it);
    } else if(aod > aev) {
        b = od;
        cout << aod << endl;
    } else {
        b = ev;
        cout << aev << endl;
    }
    vector<ll> ans;
    for(ll i = b.size() - 1; i > 0; i--) {
        rep(j, (b[i] - b[i - 1]) / 2) { ans.push_back(2 + j); }
    }
    rep(i, b.front()) ans.push_back(1);
    rep(i, n - b.back() - 1) ans.push_back(b.back() + 2 + i);
    cout << ans.size() << endl;
    rep(i, ans.size()) cout << ans[ans.size() - i - 1] << endl;
    return 0;
}

Measured memory_bytes: 256