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

int main(void)
{
    int n;
    int v[1000] = {0};
    int dp[1000] = {0};
    cin >> n;
    for(int i = 0; i < n; i++)
        cin >> v[i];
    vector<int> res[1000];
    dp[0] = v[0];
    res[0].push_back(0);
    if(v[0] < v[1]) {
        dp[1] = v[1];
        res[1].push_back(1);
    }
    else {
        dp[1] = v[0];
        res[1] = res[0];
    }
    for(int i = 2; i < n; i++) {
        if(dp[i - 2] + v[i] > dp[i - 1]) {
            res[i] = res[i - 2];
            res[i].push_back(i);
            dp[i] = dp[i - 2] + v[i];
        }
        else {
            res[i] = res[i - 1];
            dp[i] = dp[i - 1];
        }
    }
    cout << dp[n - 1] << endl;
    if(res[n - 1].size() == 0) {
        cout << 0 << endl;
        return 0;
    }
    cout << res[n - 1][0] + 1;
    for(int i = 1; i < res[n - 1].size(); i++)
        cout << " " << res[n - 1][i] + 1;
    return 0;
}