#define _CRT_SECURE_NO_WARNINGS
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define int ll
//#define endl "\n"
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
#define all(c) (c).begin(), (c).end()
#define loop(i,a,b) for(ll i=a; i<ll(b); i++)
#define rep(i,b) loop(i,0,b)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
template<class T> ostream & operator<<(ostream & os, vector<T> const &);
template<int n, class...T> typename enable_if<(n>=sizeof...(T))>::type _ot(ostream &, tuple<T...> const &){}
template<int n, class...T> typename enable_if<(n< sizeof...(T))>::type _ot(ostream & os, tuple<T...> const & t){ os << (n==0?"":" ") << get<n>(t); _ot<n+1>(os, t); }
template<class...T> ostream & operator<<(ostream & os, tuple<T...> const & t){ _ot<0>(os, t); return os; }
template<class T, class U> ostream & operator<<(ostream & os, pair<T,U> const & p){ return os << "(" << p.first << ", " << p.second << ") "; }
template<class T> ostream & operator<<(ostream & os, vector<T> const & v){ rep(i,v.size()) os << v[i] << (i+1==(int)v.size()?"":" "); return os; }
template<class T> inline bool chmax(T & x, T const & y){ return x<y ? x=y,true : false; }
template<class T> inline bool chmin(T & x, T const & y){ return x>y ? x=y,true : false; }
#ifdef DEBUG
#define dump(...) (cerr<<#__VA_ARGS__<<" = "<<mt(__VA_ARGS__)<<" ["<<__LINE__<<"]"<<endl)
#else
#define dump(...)
#endif
// ll const mod = 1000000007;
// ll const inf = 1LL<<60;

int N;

int dp[2000];
int a[2000];

int rec(int k){
    int & res = dp[k];
    if(res != -1) return res;
    if(k >= N) return res = 0;
    res = 0;
    int x = a[k]+rec(k+2);
    int y = rec(k+1);
    if(res < x){
        res = x;
        //
    }
    if(res < y){
        res = y;
    }
    return res;
}

signed main(){
    cin >> N;
    rep(i,N) cin >> a[i];
    memset(dp,-1,sizeof dp);
    cout << rec(0) << endl;
    dump(vi(dp,dp+N));
    vector<int> res;
    int i = 0;
    while(i<N){
        if(dp[i]-a[i]==dp[i+2]){
            res.pb(i);
            i = i+2;
        } else {
            i = i+1;
        }
    }
    rep(i,res.size()){
        cout << res[i]+1 << (i==(int)res.size()-1 ? "\n":" ");
    }
}