#include <iostream>
#include <stack>
using namespace std;

const int MAX_N = 1010;

int v[MAX_N];
int dp[MAX_N][2];
int pre[MAX_N][2];

int main() {
    int n;
    cin >> n;

    for (int i = 0; i < n; i++) {
        cin >> v[i];
    }

    pre[0][1] = -1;
    for (int i = 0; i < n; i++) {
        for (int can = 0; can <= 1; can++) {
            if (can) {
                if (dp[i][1] >= dp[i][0]) {
                    dp[i + 1][can] = dp[i][1];
                    pre[i + 1][can] = pre[i][1];
                } else {
                    dp[i + 1][can] = dp[i][0];
                    pre[i + 1][can] = pre[i][0];
                }
            } else {
                dp[i + 1][can] = dp[i][1] + v[i];
                pre[i + 1][can] = i;
            }
        }
    }
    int p;
    if (dp[n][0] >= dp[n][1]) {
        cout << dp[n][0] << endl;
        p = pre[n][0];
    } else {
        cout << dp[n][1] << endl;
        p = pre[n][1];
    }

    stack<int> st;
    while (p != -1) {
        st.push(p);
        p = pre[p][1];
    }
    cout << st.top() + 1; st.pop();
    while (!st.empty()) {
        cout << " " << st.top() + 1;
        st.pop();
    }
    cout << endl;

    return 0;
}