#include <iostream>
#include <algorithm>
#include <string>
#include <vector>

using namespace std;

int main(){
    int n;
    cin >> n;
    int v1 = 0;
    vector<int> v1_seq;
    int v0 = 0;
    vector<int> v0_seq;
    for(int i = 0; i < n; i++){
        int v;
        cin >> v;

        int v1_new = 0;
        int v0_new = 0;

        vector<int> prev_v0_seq = v0_seq;

        if(v1 > v0){
            v0_seq = v1_seq;
            v0_new = v1;
        }else{
            v0_new = v0;
        }

        if(v1 < v0 + v){
            v1_new = v0 + v;
            v1_seq = prev_v0_seq;
            v1_seq.push_back(i+1);
        }else{
            v1_new = v1;
        }


        v1 = v1_new;
        v0 = v0_new;
    }
    if(v0 > v1) v1_seq = v0_seq;
    cout << max(v0, v1) << endl;
    for(int i = 0; i < v1_seq.size(); i++){
        cout << v1_seq[i];
        if(i+1 < v1_seq.size()) cout << " ";
        else cout << endl;
    }
    return 0;
}