//https://ncode.syosetu.com/n4830bu/258/
#include <bits/stdc++.h>
using namespace std;

int main() {
    int N;
    cin >> N;
    vector<int> V(N);
    for (auto&& v : V) {
        cin >> v;
    }
    vector<int> bef(N, -1), score(N, 0);
    for (int i = 0; i < N; i++) {
        score[i] = V[i];
        for (int j = 0; j < i - 1; j++) {
            if (score[j] + V[i] > score[i]) {
                score[i] = score[j] + V[i];
                bef[i] = j;
            }
        }
    }
    int ans_idx = max_element(score.begin(), score.end()) - score.begin();
    int ans_score = score[ans_idx];
    vector<int> ans_vec;
    while (ans_idx != -1) {
        ans_vec.emplace_back(ans_idx + 1);
        ans_idx = bef[ans_idx];
    }
    reverse(ans_vec.begin(), ans_vec.end());
    cout << ans_score << endl;
    for (int i = 0; i < ans_vec.size(); i++) {
        cout << ans_vec[i] << " \n"[i == ans_vec.size() - 1];
    }
}