#include <bits/stdc++.h>

using namespace std;

int main() {
    int n;
    int v[1000];
    int prev[1000] = {};

    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> v[i];
        if (i < 2) {
            prev[i] = -1;
        } else if (i < 3) {
            prev[i] = i - 2;
            v[i] += v[i - 2];
        } else {
            if (v[i - 3] < v[i - 2]) {
                prev[i] = i - 2;
                v[i] += v[i - 2];
            } else {
                prev[i] = i - 3;
                v[i] += v[i - 3];
            }
        }
    }

    vector<int> idx;
    int st = n - 1;
    if (n - 2 >= 0 && v[n - 2] > v[n - 1]) {
        st = n - 2;
    }

    for (int i = st; i != -1; i = prev[i]) {
        idx.push_back(i);
    }
    reverse(idx.begin(), idx.end());

    cout << v[st] << endl;
    for (int i = 0; i < idx.size(); i++) {
        if (i) {
            cout << ' ';
        }
        cout << idx[i] + 1;
    }
    cout << endl;

    return 0;
}