/*
ЗАПУСКАЕМ 
░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░▄▀▒▒▀▀▀▀▄
░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░▀▄░░░░▀▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░░░▀▄▄▄▄▄█▄▄▄▄▄▄▄▄▄▄▄▀▄
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░▄▄▌▌▄▌▌░░░░░ 
 */
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
    
     
using namespace std;
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; } 
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const pair<T, U> &_p) { _out << _p.first << ' ' << _p.second; return _out; }
template<typename T, typename U> inline istream &operator>> (istream &_in, pair<T, U> &_p) { _in >> _p.first >> _p.second; return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const vector<T> &_v) { if (_v.empty()) { return _out; } _out << _v.front(); for (auto _it = ++_v.begin(); _it != _v.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline istream &operator>> (istream &_in, vector<T> &_v) { for (auto &_i : _v) { _in >> _i; } return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const unordered_map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left228
#define right right228
#define next next228
#define rank rank228
#define prev prev228
#define y1 y1228                                                         
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define files(FILENAME) read(FILENAME), write(FILENAME)
#define pb push_back
#define x first
#define y second
const string FILENAME = "input";
const int MAXN = 1001;

int n;
int a[MAXN];
long long dp[MAXN][MAXN];
long long dp1[MAXN][MAXN];
vector<int> g;


void restore(int extra, int i, int j) {
    if (i == j) {
        return;
    }
    long long t[2] = {-1000000000000000000LL, -1000000000000000000LL};
    int pos[2];
   // cout << i << ' ' << j << endl;
    for (int k = j; k >= max(i, j - 30); --k) {
        if (k <= j - 2) {
            if (dp[i][j] == dp[i][k] + t[k & 1]) {
               // cout << "opa" << endl;
                restore(extra, i, k);
                int t = pos[k & 1] - k - 1;
                while (t != 1) {
                    g.push_back(3 + extra);
                    t -= 2;
                }
                restore(extra + 2, pos[k & 1], j);
                g.push_back(2 + extra);
                return;
            }
        }
        if (t[k & 1] < dp[k][j]) {
            pos[k & 1] = k;
            t[k & 1] = dp[k][j];
        }
    }
}



int main(){
	ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
   // read(FILENAME);
    cin >> n;
  //  n = 1000;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        //a[i] = rand() % 2000000001 - 1000000000;
    }
    for (int i = n - 1; i >= 0; i--) {
        for (int j = i; j < n; j++) {
            if (i == j) {
                dp[i][j] = a[i];
                continue;
            }
            if (i + 1 == j) {
                dp[i][j] = -1000000000000000000LL;
                continue;
            }
            dp[i][j] = -1000000000000000000LL;
            long long t[2] = {-1000000000000000000LL, -1000000000000000000LL};
            for (int k = j; k >= max(i, j - 300); --k) {
                if (k <= j - 2) {
                    chkmax(dp[i][j], dp[i][k] + t[k & 1]);
                }
                chkmax(t[k & 1], dp[k][j]);
            }
        }
    }
    long long ans = -1000000000000000000LL;
    for (int i = 0; i < n; i++) {
        for (int j = i; j < n; j++) {
            chkmax(ans, dp[i][j]);
        }
    }
    cout << ans << endl;
   // return 0;
     for (int i = 0; i < n; i++) {
        for (int j = i; j < n; j++) {
            if (ans == dp[i][j]) {
                int cur = n;
                for (int t = 0; t < i; t++) {
                    g.push_back(1);
                    cur--;
                }
                for (int t = j + 1; t < n; t++) {
                    g.push_back(cur);
                    cur--;
                }
         //       cout << i << ' ' << j << endl;
                 restore(0, i, j);
                cout << sz(g) << '\n'; 
                for (auto x: g) {
                    cout << x << '\n';
                }
                return 0;
            }
        }
     }
    return 0;   
}


Measured memory_bytes: 9344