#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a, b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout<<" "<<kbrni;cout<<endl
#define smap(m) cout<<#m<<":";each(kbrni,m)cout<<" {"<<kbrni.first<<":"<<kbrni.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int>P;

const int MAX_N = 1005;

int dp[MAX_N][2];

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<int> vec(n);
    rep(i,n){
        cin >> vec[i];
    }
    rep(i,n+1){
        rep(j,2){
            dp[i][j] = 0;
        }
    }
    rep(i,n+1){
        dp[i+1][0] = max(dp[i+1][0],dp[i][0]);
        dp[i+1][0] = max(dp[i+1][0],dp[i][1]);
        dp[i+1][1] = max(dp[i+1][1],dp[i][0]+vec[i]);
    }
    vector<int> use;
    int id1,id2;
    if(dp[n][0] > dp[n][1]){
        cout << dp[n][0] << endl;
        id1 = n,id2 = 0;
    }else{
        cout << dp[n][1] << endl;
        id1 = n,id2 = 1;
    }
    while(id1){
        id1--;
        if(id2 == 0){
            if(dp[id1+1][id2] != dp[id1][id2]){
                id2 = 1;
            }
        }else{
            use.pb(id1);
            id2 = 0;
        }
    }
    sort(all(use));
    int cnt = (int)use.size();
    rep(i,cnt-1){
        cout << use[i] + 1 << " ";
    }
    cout << use[cnt-1] + 1 << endl;
    return 0;
}