// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(st, itr) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define vrep(v, i) for(int i = 0; i < (v).size(); i++)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
#define dump(a, n) for(int i = 0; i < n; i++)cout << a[i] << "\n "[i + 1 != n];
#define dump2(a, n, m) for(int i = 0; i < n; i++)for(int j = 0; j < m; j++)cout << a[i][j] << "\n "[j + 1 != m];
using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
typedef complex<double> cd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}


int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<ll> a(n);
  cin >> a;
  bool pos = false;
  rep(i, n){
    if(a[i] >= 0)pos = true;
  }
  if(!pos){
    int id = max_element(all(a)) - a.begin();
    cout << a[id] << endl;
    cout << n - 1 << endl;
    for(int i = 0; i < id; i++)cout << 1 << endl;
    for(int i = id + 1; i < n; i++)cout << n - i + 1 << endl;
    return 0;
  }
  ll currl = 0, currr = 0;
  rep(i, n){
    if(i % 2 == 0 && a[i] >= 0)currl += a[i];
    if(i % 2 == 1 && a[i] >= 0)currr += a[i];
  }
  cout << max(currr, currl) << endl;
  int c = (currr > currl ? 1: 0);
  vector<int> ans;
  vector<bool> used(n, false);
  for(int i = 0; i < n; i++){
    if(i % 2 == c && a[i] >= 0)break;
    ans.pb(1);
    used[i] = true;
  }
  for(int i = n - 1; i >= 0; i--){
    if(i % 2 == c && a[i] >= 0)break;
    int cnt = 0;
    rep(k, i)if(!used[k])cnt++;
    ans.pb(cnt + 1);
    used[i] = true;
  }
  while(true){
    vector<bool> v;
    vector<int> id;
    rep(i, n){
      if(!used[i]){
        id.pb(i);
        if(i % 2 == c && a[i] >= 0)v.pb(true);
        else v.pb(false);
      }
    }
    if(v.size() == 1)break;
    for(int i = 0; i < sz(v); i++){
      if(!v[i]){
        if((v[i-1] && v[i+1]) || (!v[i-1] && !v[i+1])){
          ans.pb(i+1);
          used[id[i]] = true;
          used[id[i+1]] = true;
          break;
        }
      }
    }
  }
  cout << sz(ans) << endl;
  rep(i, sz(ans))cout << ans[i] << endl;
  return 0;
}


Measured memory_bytes: 256