#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
#define dump(x)                             \
    if (dbg) {                              \
        cerr << #x << " = " << (x) << endl; \
    }
#define overload4(_1, _2, _3, _4, name, ...) name
#define FOR1(n) for (ll i = 0; i < (n); ++i)
#define FOR2(i, n) for (ll i = 0; i < (n); ++i)
#define FOR3(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
namespace mydef {
const int INF = 1ll << 60;
const int MOD = 1e9 + 7;
template <class T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;
        return 1;
    } else
        return 0;
}
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    } else
        return 0;
}
void Yes(bool flag = true) {
    if (flag)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
}
void No(bool flag = true) {
    Yes(!flag);
}
void YES(bool flag = true) {
    if (flag)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
}
void NO(bool flag = true) {
    YES(!flag);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T& val) {
    std::fill((T*)array, (T*)(array + N), val);
}
}  // namespace mydef
using namespace mydef;
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define SZ(x) ((int)(x).size())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vp vector<pair<int, int>>
#define vvp vector<vector<pair<int, int>>>
#define pi pair<int, int>
//#define P pair<int, int>
//#define V vector<int>
//#define S set<int>
#define itn int
#define asn ans
bool dbg = false;

int N, A[101010];
int ans[101010];
int bef[101010];
set<int> S;
int tmp;

vi pnt;

void f(int l, int r) {
    int n = r - l + 1;
    for (int i = (n + 1) / 2 + 1; i > 1; i--)
        pnt.pb(i);
}
void solve() {
    FOR (i, N) {
        bef[i] = -1;
        int MAX = 0;
        for (int j = i % 2; j < i - 1; j += 2) {
            if (MAX < ans[j]) {
                bef[i] = j;
                MAX = ans[j];
            }
        }
        ans[i] = MAX + A[i];
        if (ans[i] > ans[tmp])
            tmp = i;
    }
    cout << ans[tmp] << endl;

    while (tmp != -1) {
        S.insert(tmp);
        tmp = bef[tmp];
    }
    auto it = S.begin();
    int L = *it;
    it = S.end();
    it--;
    int R = *it;
    for (int i = N - 1; i > R; i--)
        pnt.pb(i + 1);
    FOR (L)
        pnt.pb(1);
    while (S.size() > 1) {
        int l = *(S.begin());
        S.erase(l);
        int r = *(S.begin());
        f(l + 1, r - 1);
    }

    cout << (int)pnt.size() << endl;
    for (auto a : pnt)
        cout << a << endl;
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    cin >> N;
    FOR (N)
        cin >> A[i];


    solve();
    return 0;
}


Measured memory_bytes: 384