#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];
    dp[0] = v[0];
    dp[1] = max(v[0], v[1]);
    for(int i = 2; i < n; i++) {
        dp[i] = max(dp[i - 2] + v[i], dp[i - 1]);
    }
    cout << dp[n - 1] << endl;
    vector<int> res;
    int k = n - 1;
    while(k >= 2) {
        if(dp[k - 2] + v[k] == dp[k]) {
            res.push_back(k);
            k = k - 2;
        }
        else {
            k = k - 1;
        }
    }
    cout << ((v[0] > v[1]) ? 1 : 2);
    for(int i = res.size() - 1; i >= 0; i--)
        cout << " " << res[i] + 1;
    cout << endl;
    return 0;
}