#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
//constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;
const long double PI = acos((long double)(-1));

using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;

int main()
{
    /*
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    */
    int n; scanf("%d", &n);
    vector<int> v(n); for (int i = 0; i < n; i++) scanf("%d", &v[i]);
    vector<vector<int>> dp(n + 1, vector<int>(2, -inf)), back(n + 1, vector<int>(2, -1));
    dp[0][0] = 0;
    for (int i = 0; i < n; i++) for (int j = 0; j < 2; j++) {
        if (dp[i][j] == -inf) continue;
        if (chmax(dp[i + 1][0], dp[i][j])) back[i + 1][0] = j;
        if (j == 0) {
            if (chmax(dp[i + 1][1], dp[i][j] + v[i])) back[i + 1][1] = j;
        }
    }
    vector<int> res;
    int cur;
    if (dp[n][0] > dp[n][1]) {
        printf("%d\n", dp[n][0]);
        cur = back[n][0];
    }
    else {
        printf("%d\n", dp[n][1]);
        res.emplace_back(n - 1);
        cur = back[n][1];
    }
    for (int i = n - 2; i >= 0; i--) {
        if (cur == 1) res.emplace_back(i);
        cur = back[i + 1][cur];
    }
    reverse(res.begin(), res.end());
    for (int i = 0; i < res.size(); i++) printf("%d%c", res[i] + 1, " \n"[i + 1 == res.size()]);
    return 0;
}