#define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <utility>
#include <algorithm>
#include <functional>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <limits>
#include <numeric>
#include <valarray>
#include <fstream>

using namespace std;
typedef unsigned int uint;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<LL, LL> PP;
#define REP(i,a,n) assert(n < 0x80000000); for(int i = (a), i##_max = n; i < i##_max; ++i)
#define REM(i,a,n) assert(n < 0x80000000); for(int i = int(n) - 1, i##min = a; i >= i##min; --i)
#define ALL(arr) (arr).begin(), (arr).end()
#define FLOAT fixed << setprecision(16)
#define SPEEDUP {cin.tie(NULL); ios::sync_with_stdio(false);}
const int INF = 0x3FFFFFFF;
const LL INFLL = 0x3FFFFFFF3FFFFFFF;
const double INFD = 1.0e+308;
const string INFSTR = "\x7f";
const double EPS = 1.0e-9;

void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
template <class T, class U>
istream& operator>>(istream& ist, pair<T, U>& right) { return ist >> right.first >> right.second; }
template <class T, class U>
ostream& operator<<(ostream& ost, const pair<T, U>& right) { return ost << right.first << ' ' << right.second; }
template <class T, class TCompatible, size_t N>
void Fill(T(&dest)[N], const TCompatible& val) { fill(dest, dest + N, val); }
template <class T, class TCompatible, size_t M, size_t N>
void Fill(T(&dest)[M][N], const TCompatible& val) { for (int i = 0; i < M; ++i) Fill(dest[i], val); }
template<class T>
T Compare(T left, T right) { return left > right ? 1 : (left < right ? -1 : 0); }
istream& Ignore(istream& ist) { string s; ist >> s; return ist; }
bool Inside(int i, int j, int h, int w) { return i >= 0 && i < h && j >= 0 && j < w; }

#ifdef ONLY_MY_ENVIR
#include "IntMod.h"
#include "Union_Find.h"
#include "Graph.h"
#include "Range.h"
#include "Global.h"
#include "Flow_Solver.h"
#include "Tree.h"
#include "Suffix_Array.h"
#include "Geometry.h"
#include "Matrix.h"
#include "Segment_Tree.h"
#include "Rational.h"
#endif

#ifdef __GNUC__
typedef __int128 LLL;
istream& operator>> (istream& ist, __int128& val) { LL tmp;  ist >> tmp; val = tmp; return ist; }
ostream& operator<< (ostream& ost, __int128 val) { LL tmp = val; ost << tmp; return ost; }
#endif

#if 1234567891
#include <array>
#include <random>
#include <unordered_set>
#include <unordered_map>
template<typename T>
using PriorityQ = priority_queue<T, vector<T>, greater<T> >;	// コスト小を優先
template <class T>
auto Is(const T& value) { return [value](const auto& comparand) -> bool { return comparand == value; }; }
#endif

int N;
vector<LL> A;
vector<int> ans;


int main() {
	cin >> N;
	REP(i, 0, N) {
		LL a;
		cin >> a;
		A.push_back(a);
	}

	if (all_of(A.begin(), A.end(), [](int i) {return i < 0; })) {
		int mx = -INF;
		int mx_idx = 0;
		REP(i, 0, A.size()) {
			if (A[i] > mx) {
				mx = A[i];
				mx_idx = i;
			}
		}
		cout << mx << endl << N - 1 << endl;
		REM(i, mx_idx + 1, N) cout << i + 1 << endl;
		REP(i, 0, mx_idx) cout << 0 + 1 << endl;
		return 0;
	}

	LL odd = 0;
	LL even = 0;
	REP(i, 0, N) {
		(i % 2 == 0 ? even : odd) += max(A[i], 0LL);
	}

	if (even >= odd) {
	} else {
		ans.push_back(0);
		A.erase(A.begin());
	}

	if (A.size() % 2 == 0) {
		ans.push_back(A.size() - 1);
		A.pop_back();
	}

	while (A[0] < 0) {
		ans.push_back(0);
		A.erase(A.begin());
		ans.push_back(0);
		A.erase(A.begin());
	}

	while (A.back() < 0) {
		ans.push_back(A.size() - 1);
		A.pop_back();
		ans.push_back(A.size() - 1);
		A.pop_back();
	}

	assert(A.size() % 2 == 1);

	while (A.size() > 1) {
		bool minus = false;
		for (int i = 0; i < A.size(); i += 2) {
			if (A[i] < 0) {
				ans.push_back(i);
				A[i] = A[i - 1] + A[i + 1];
				A.erase(A.begin() + (i + 1));
				A.erase(A.begin() + (i - 1));
				minus = true;
				break;
			}
		}

		if (!minus) break;
	}

	while (A.size() > 1) {
		A[1] = A[0] + A[2];
		A.erase(A.begin() + 2);
		A.erase(A.begin());
		ans.push_back(1);
	}

	cout << A[0] << endl << ans.size() << endl;
	for (int a : ans) {
		cout << a + 1<< endl;
	}

	return 0;
}



Measured memory_bytes: 256