#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <functional>

#define FORR(i,b,e) for(int i=(b);i<(int)(e);++i)
#define FOR(i,e) FORR(i,0,e)
#define sortuniq(v) sort(v.begin(), v.end()), v.erase(unique(v.begin(),v.end()),v.end())
#define dump(var) cerr << #var ": " << var << "\n"
#define dumpc(con) for(auto& e: con) cerr << e << " "; cerr<<"\n"

typedef long long ll;
typedef unsigned long long ull;

const double EPS = 1e-6;
const int d4[] = {0, -1, 0, 1, 0};

using namespace std;


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N;
    cin >> N;
    vector<int> pre(N+3, -1), val(N+3, 0);

    FORR(i, 3, N+3) {
        int v;
        cin >> v;
        if (val[i-2] < val[i-3]) {
            val[i] = v + val[i-3];
            pre[i] = i-3;
        }
        else {
            val[i] = v + val[i-2];
            pre[i] = i-2;
        }
    }
    
    function<void(int&)> prnt = [&](int &idx) {
        if (pre[idx] < 3) {
            cout << idx-2;
        }
        else {
            prnt(pre[idx]);
            cout << ' ' << idx-2;
        }
    };

    int last = val[N+1]<val[N+2]? N+2: N+1;
    cout << val[last] << endl;
    prnt(last);
    cout << endl;

    return 0;
}