#include <bits/stdc++.h>

using namespace std;

#define rep(i, n) for(int i = 0; i < (int)n; ++i)
#define FOR(i, a, b) for(int i = a; i < (int)b; ++i)
#define rrep(i, n) for(int i = ((int)n - 1); i >= 0; --i)

using ll = long long;
using ld = long double;

const int Inf = 1e9;
const double EPS = 1e-9;
const int MOD = 1e9 + 7;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(0);
    int n;
    cin >> n;
    vector<int> v(n);
    rep (i, n) cin >> v[i];
    vector<pair<int, int> > dp(n + 1);
    FOR (i, 1, n + 1) {
        rep (j, i) {
            if (i != 1 && abs(i - j) <= 1) continue;
            if (dp[i].first < dp[j].first + v[i - 1]) {
                dp[i].first = dp[j].first + v[i - 1];
                dp[i].second = j;
            }
        }
    }

    int res = 0;
    int id = 0;
    rep (i, n) {
        if (res < dp[i + 1].first) {
            res = dp[i + 1].first;
            id = i + 1;
        }
    }
    vector<int> dish;
    while (id > 0) {
        dish.push_back(id);
        id = dp[id].second;
    }
    cout << res << endl;
    rrep (i, dish.size()) {
        cout << dish[i];
        if (i == 0) cout << endl;
        else cout << " ";
    }
    
    return 0;
}