#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;


template<class T = int>
class BinaryIndexedTree_1_indexed{
  void init(const vector<T> &A){
    for(int i=0; i<N; i++){
      add(i+1, A[i]);
    }
  }
  
public:
  vector<T> tree;
  int N;
  
  BinaryIndexedTree_1_indexed(const int n) : tree(n+1,0), N(n){
    
  }
  
  BinaryIndexedTree_1_indexed(const vector<T> &A) : tree(A.size()+1,0), N(A.size()){
    init(A);
  }

  //caution : position "i" must be 1-indexed
  void add(int i, const T x){
    while(i <= N){
      tree[i] += x;
      i += i & -i;
    }
  }

  //update node i to zero
  void to_zero(const int i){
    T val = get_at(i);
    add(i, -val);
  }

  //get sums [0,i]
  T get_sum(int i){
    T ret=0;
    while(i>0){
      ret += tree[i];
      i -= i & -i;
    }
    return ret;
  }

  //get sums [from,to]
  T get_sums_range(const int from, const int to){
    return get_sum(to) - get_sum(from-1);
  }

  //get at [i]
  T get_at(const int i){
    return get_sum(i) - get_sum(i-1);
  }

  int lower_bound(T val){
    if(val<=0) return 0;
    int x = 0;
    int k = 1;
    while((k<<1) <= N) k<<=1;
    
    for( ; k>0; k>>=1){
      if( x+k <= N && tree[x+k] < val ){
        val -= tree[x+k];
        x += k;
      }
    }
    return x+1;
  }

  void print(){
    for(int i=0; i<=N; i++){
      cerr << tree[i] << " ";
    }
    cerr << endl;
  }
};

// long long check(vector<long long> a, vector<int> op){
//   int n = a.size();
//   BinaryIndexedTree_1_indexed<int> bit(n+1);

//   set<pair<int,int>> s;

//   for(int i=0; i<n; i++){
//     bit.add(i+1, 1);
//   }


//   int sz = n;
//   for(int i=0; i<op.size(); i++){
//     if( i==1 ){
//       int pos = bit.lower_bound(1);
//       bit
//     }else if( i==sz ){

//     }else{

//     }
//   }
// }


int main(){
  int n;
  cin >> n;
  vector<long long> a(n);
  cin >> a;


  vector<long long> dp_l(n, -(1ll<<50));
  vector<long long> pr_l(n, -1);
  for(int i=0; i<n; i++){
    dp_l[i] = max(dp_l[i], a[i]);
    pr_l[i] = i;
    for(int j=i-2; j>=0; j-=2){
      if( dp_l[i] < a[i] + dp_l[j] ){
        dp_l[i] = max(dp_l[i], a[i] + dp_l[j]);
        pr_l[i] = j;
      }
    }
  }

  reverse(a.begin(), a.end());
  vector<long long> dp_r(n, -(1ll<<50));
  vector<long long> pr_r(n, -1);
  for(int i=0; i<n; i++){
    dp_r[i] = max(dp_r[i], a[i]);
    pr_r[i] = n-1-i;
    for(int j=i-2; j>=0; j-=2){
      if( dp_r[i] < a[i] + dp_r[j] ){
        dp_r[i] = max(dp_r[i], a[i] + dp_r[j]);
        pr_r[i] = n-1-j;
      }
    }
  }

  reverse(a.begin(), a.end());
  reverse(dp_r.begin(), dp_r.end());
  reverse(pr_r.begin(), pr_r.end());

  enum class Mode{
    A,
    L,
    R,
    LR
  };

  Mode mode;

  long long ans = max({
    *max_element(a.begin(), a.end()),
    *max_element(dp_l.begin(), dp_l.end()),
    *max_element(dp_r.begin(), dp_r.end())
  });


  if( count(a.begin(), a.end(), ans) ){
    mode = Mode::A;
  }else if( count(dp_l.begin(), dp_l.end(), ans) ){
    mode = Mode::L;
  }else if( count(dp_r.begin(), dp_r.end(), ans) ){
    mode = Mode::R;
  }

  pair<int,int> ans_;
  for(int i=0; i<n; i++){
    for(int j=i+2; j<n; j+=2){
      long long tmp = dp_l[i] + dp_r[j];
      if( tmp > ans ){
        ans = max(tmp, ans);
        mode = Mode::LR;
        ans_ = {i,j};
      }
    }
  }

  println(ans);

  if(mode == Mode::A){
    vector<int> op;
    deque<long long> dq(a.begin(), a.end());
    while(dq.front() != ans){
      op.push_back(1);
      dq.pop_front();
    }
    while(dq.size() != 1){
      op.push_back(dq.size());
      dq.pop_back();
    }
    println(op.size());
    println(join(op, "\n"));
    return 0;
  }

  BinaryIndexedTree_1_indexed<int> bit(n+1);
  for(int i=1; i<=n; i++){
    bit.add(i, 1);
  }

  vector<int> op;

  auto merge = [&](int i){
    int pos = bit.get_sum(i+1);
    int nx = bit.lower_bound(pos+1);
    bit.add(i+1, -1);
    bit.add(nx, -1);

    op.push_back(pos);
  };

  // [l,r] => single
  function<void(int, int)> del = [&](int l, int r){
    if( l==r ) return;
    for(int i=l+1; i<r; i+=2){
      merge(i);
    }
  };

  if(mode == Mode::L){
    int pos = find(dp_l.begin(), dp_l.end(), ans) - dp_l.begin();
    while( a.size() > pos+1 ){
      op.push_back( a.size() );
      bit.add(a.size(), -1);
      a.pop_back();
    }
    while(pos != pr_l[pos]){
      int pr = pr_l[pos];
      del(pr+1, pos-1);
      merge(pr+1);
      pos = pr;
    }
    while(pos){
      int at = bit.lower_bound(1);
      bit.add(at, -1);
      op.push_back(1);
      pos--;
    }

    println(op.size());
    println(join(op, "\n"));
    return 0;
  }

  if(mode == Mode::R){
    int pos = find(dp_r.begin(), dp_r.end(), ans) - dp_r.begin();
    for(int cnt=pos, i=1; cnt; cnt--, i++){
      op.push_back(1);
      bit.add(i, -1);
    }
    while(pos != pr_r[pos]){
      int pr = pr_r[pos];
      del(pos+1, pr-1);
      merge(pos+1);
      pos = pr;
    }
    for(int i=n-1; i>pos; i--){
      int at = bit.get_sum(i+1);
      op.push_back(at);
      bit.add(i+1, -1);
    }

    println(op.size());
    println(join(op, "\n"));
    return 0;
  }

  if(mode == Mode::LR){
    {
      int pos = ans_.first;
      while(pos != pr_l[pos]){
        int pr = pr_l[pos];
        del(pr+1, pos-1);
        merge(pr+1);
        pos = pr;
      }
      while(pos){
        int at = bit.lower_bound(1);
        bit.add(at, -1);
        op.push_back(1);
        pos--;
      }
    }
    {
      int pos = ans_.second;
      while(pos != pr_r[pos]){
        int pr = pr_r[pos];
        del(pos+1, pr-1);
        merge(pos+1);
        pos = pr;
      }
      for(int i=n-1; i>pos; i--){
        int pos = bit.get_sum(i+1);
        op.push_back(pos);
        bit.add(i+1, -1);
      }
    }

    del( ans_.first+1, ans_.second-1 );

    println(op.size());
    println(join(op, "\n"));

  }

  return 0;
}


Measured memory_bytes: 256