#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
// constexpr int mod = 1000000007;
constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N;
    cin >> N;
    vector<int> V(N);
    for(int i = 0; i < N; ++i)  cin >> V[i];

    vector<vector<int>> dp(N + 1, vector<int>(2, -1));
    using P = pair<int, int>;
    vector<vector<P>> restore(N + 1, vector<P>(2));
    dp[0][0] = 0;
    for(int i = 0; i < N; ++i){
        for(int j = 0; j < 2; ++j){
            if(dp[i][j] == -1)  continue;
            if(chmax(dp[i + 1][0], dp[i][j])){
                restore[i + 1][0] = P(i, j);
            }
            if(j == 0 && chmax(dp[i + 1][1], dp[i][0] + V[i])){
                restore[i + 1][1] = P(i, 0);
            }
        }
    }
    
    int i = N, j = -1, ans = -1;
    if(chmax(ans, dp[N][0]))    j = 0;
    if(chmax(ans, dp[N][1]))    j = 1;
    cout << ans << '\n';
    vector<int> idx;
    while(i > 0){
        auto [ni, nj] = restore[i][j];
        if(j == 1 && nj == 0)   idx.emplace_back(i);
        i = ni, j = nj;
    }
    reverse(begin(idx), end(idx));
    int n = idx.size();
    for(i = 0; i < n; ++i){
        cout << idx[i] << (i == n - 1 ? '\n' : ' ');
    }

    return 0;
}