#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <iomanip>
//#include <utility>
//#include <memory>
//#include <functional>
//#include <deque>
//#include <cctype>
//#include <ctime>
//#include <numeric>
//#include <list>
//#include <iomanip>

//#if __cplusplus >= 201103L
//#include <array>
//#include <tuple>
//#include <initializer_list>
//#include <forward_list>
//
//#define cauto const auto&
//#else

//#endif

using namespace std;


typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()
#define DEBUG
#ifdef DEBUG
#define dump(x)  cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#else
#define dump(x) 
#define debug(x) 
#endif
#define LDcout(x,n) fixed<<setprecision(n)<<x

#define MOD 1000000007LL
#define EPS 1e-8
static const int INF=1<<24;
pii dp[1010][2];
void mainmain(){
    int n;
    cin>>n;
    vint v(n);
    rep(i,n) cin>>v[i];
    rep(i,1010) rep(j,2) dp[i][j]=pii(0,-1);
    rep(i,n){
        if(!i){
            dp[i][0]=pii(v[0],-1);
            continue;
        }
        dp[i][0]=dp[i-1][1];
        dp[i][0].F+=v[i];
        if(dp[i-1][0].F<dp[i-1][1].F){
            dp[i][1]=dp[i-1][1];
        }
        else{
            dp[i][1]=dp[i-1][0];
            dp[i][1].S=i-1;
        }
    }
    vint ans;
    int MAX;
    int pos=n-1;
    if(dp[n-1][0].F>dp[n-1][1].F){
        MAX=dp[n-1][0].F;
        // ans.PB(n-1);
    }
    else{
        pos=dp[n-1][1].S;
        MAX=dp[n-1][1].F;
    }
    while(1){
        if(pos==-1) break;
        ans.PB(pos);
        pos=dp[pos][0].S;
    }
    sort(ALL(ans));
    cout<<MAX<<endl;
    rep(i,ans.size()){
        if(i) cout<<" ";
        cout<<ans[i]+1;
    }
    cout<<endl;
}


signed main() {
    ios_base::sync_with_stdio(false);
      cout<<fixed<<setprecision(20);
    mainmain();
}