#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vec;
typedef vector<vec> mat;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define revrep(i, n) for(ll i = (n)-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
/*
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll max3(ll a, ll b, ll c){return max(a, max(b, c));};
ll min3(ll a, ll b, ll c){return min(a, min(b, c));};
ll max4(ll a, ll b, ll c, ll d){return max(max(a, b), min(c, d));};
ll min4(ll a, ll b, ll c, ll d){return min(min(a, b), min(c, d));};
ll max5(ll a, ll b, ll c, ll d, ll e){return max(max(a, b), max3(c, d, e));};
ll min5(ll a, ll b, ll c, ll d, ll e){return min(min(a, b), min3(c, d, e));};
*/
const ll INFL = 1LL << 60;//10^18 = 2^60
const int INF = 1 << 30;//10^9
ll MOD = 1000000007;
//ll MOD = 998244353;

vector<ll> dy = {0, 0, 1, -1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, -1, 0, 0, 1, -1, 1, -1, 0};

//デバッグ
void BinarySay(ll x, ll y = 60){rep(i, y) cout << (x>>(y-1-i) & 1); cout << endl;}

ll pow_long(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2) res *= x;
    x *= x;
    k /= 2;
  }
  return res;
}
ll pow_mod(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2){
      res *= x; res %= MOD;
    }
    x *= x; x %= MOD;
    k /= 2;
  }
  return res;
}

ll inverse(ll x){return pow_mod(x, MOD - 2);};

ll gcd(ll a, ll b){
    if(b == 0) return a;
    return gcd(b, a % b);
}

ll lcm(ll x, ll y){return x / gcd(x, y) * y;};

ll kai_mod(ll x){
  if(x == 0) return 1;
  return x * kai_mod(x-1) % MOD;
}


//コンビネーション
const int MAXcomb = 200010;
ll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
//facはn!,finvは1/n!
//invは逆元
void COMinit(){
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i = 2; i < MAXcomb; i++){
        fac[i] = fac[i-1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
        finv[i] = finv[i-1] * inv[i] % MOD;
    }
}
ll comb(int n, int k){
    if(n < k) return 0;
    if(n < 0 || k < 0) return 0;
    return fac[n] * finv[k] % MOD * finv[n-k] % MOD;
}


ll N;
vector<ll> A;

void solve(){
  vector<ll> odd(N+1, 0), even(N+1, 0);
  rep(i, N){
    if(i % 2){
      even[i+1] = even[i];
      odd[i+1] = odd[i] + max(A[i], 0LL);
    }else{
      even[i+1] = even[i] + max(A[i], 0LL);
      odd[i+1] = odd[i];
    }
  }

  ll max_score = -INFL;
  ll tmp_s = -1, tmp_t = -1;
  for(ll s = 0; s < N; s++){
    for(ll t = s+1; t <= N; t++){
      if((t-s) % 2 == 0) continue;
      ll score;
      if(t-s == 1){
        score = A[s];
      }else if(s % 2){
        score = A[s] + A[t-1] + odd[t-1] - odd[s+1];
      }else{
        score = A[s] + A[t-1] + even[t-1] - even[s+1];
      }
      if(score > max_score){
        max_score = score;
        tmp_s = s;
        tmp_t = t;
      }
    }
  }

  ll s = tmp_s, t = tmp_t;

  ll cnt = N - t + s;
  vector<ll> ans;
  rep(i, N-t) ans.pb(N-i);
  rep(i, s) ans.pb(1);
  vector<ll> use;
  for(ll i = s;  i < t; i++) use.pb(A[i]);
  ll rest_size = t - s;
  for(ll i = t-s-2; i > 0; i--){
    if(i % 2) continue;
    if(use[i] < 0){
      cnt++;
      ans.pb(i+1);
      rest_size -= 2;
    }
  }

  cnt += rest_size / 2;
  rep(i, rest_size/2) ans.pb(2);
  cout << max_score << endl;
  cout << cnt << endl;
  rep(i, cnt){
    cout << ans[i] << endl;
  }
}

int main(){
  cin >> N;
  A.resize(N);
  rep(i, N) cin >> A[i];
  solve();
}


Measured memory_bytes: 256