#include <bits/stdc++.h>
#define rep(i, a) for (int i = 0; i < (a); i++)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define repr(i, a) for (int i = (a) - 1; i >= 0; i--)
#define repr2(i, a, b) for (int i = (b) - 1; i >= (a); i--)
using namespace std;
typedef long long ll;
const ll inf = 1e9;

typedef pair<int, int> P;

int V[1000];
int dp[1001][2];
P dpprev[1001][2];

int main() {
    int N;
    cin >> N;
    rep (i, N) cin >> V[i];

    rep (i, N + 1) rep (j, 2) dp[i][j] = -inf;

    dp[0][0] = 0;
    dpprev[0][0] = P(-1, -1);

    rep (i, N) {
        rep (j, 2) {
            if (j == 0) {
                if (dp[i + 1][1] < dp[i][j] + V[i]) {
                    dp[i + 1][1] = dp[i][j] + V[i];
                    dpprev[i + 1][1] = P(i, j);
                }
            }

            if (dp[i + 1][0] < dp[i][j]) {
                dp[i + 1][0] = dp[i][j];
                dpprev[i + 1][0] = P(i, j);
            }
        }
    }

    int maxv = max(dp[N][0], dp[N][1]);

    vector<int> ans;
    P curr = dp[N][0] > dp[N][1] ? P(N, 0) : P(N, 1);

    while (curr.first != -1) {
        if (curr.second == 1) {
            ans.push_back(curr.first);
        }
        curr = dpprev[curr.first][curr.second];
    }

    cout << maxv << endl;

    reverse(ans.begin(), ans.end());

    rep (i, ans.size()) {
        if (i > 0) cout << " ";
        cout << ans[i];
    }
    cout << endl;
}