#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#include <random>
using namespace std;


//呪文
#define DUMPOUT cerr
#define dump(...) DUMPOUT<<"  ";DUMPOUT<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl;DUMPOUT<<"    ";dump_func(__VA_ARGS__)

typedef unsigned uint; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; typedef pair<string, string> pss;
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { ostr << "{" << m.first << ", " << m.second << "}"; return ostr; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { ostr << ", " << *itr; } ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { ostr << ", " << *itr; }	ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { ostr << ", " << *itr; }	ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const stack<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } stack<_Ty> t(s); ostr << "{" << t.top(); t.pop(); while (!t.empty()) { ostr << ", " << t.top(); t.pop(); } ostr << "}";	return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const list<_Ty>& l) { if (l.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << l.front(); for (auto itr = ++l.begin(); itr != l.end(); ++itr) { ostr << ", " << *itr; } ostr << "}"; return ostr; }
template <typename _KTy, typename _Ty> istream& operator >> (istream& istr, pair<_KTy, _Ty>& m) { istr >> m.first >> m.second; return istr; }
template <typename _Ty> istream& operator >> (istream& istr, vector<_Ty>& v) { for (size_t i = 0; i < v.size(); i++) istr >> v[i]; return istr; }
namespace aux { // print tuple
	template<typename Ty, unsigned N, unsigned L> struct tp { static void print(ostream& os, const Ty& v) { os << get<N>(v) << ", "; tp<Ty, N + 1, L>::print(os, v); } };
	template<typename Ty, unsigned N> struct tp<Ty, N, N> { static void print(ostream& os, const Ty& value) { os << get<N>(value); } };
}
template<typename... Tys> ostream& operator<<(ostream& os, const tuple<Tys...>& t) { os << "{"; aux::tp<tuple<Tys...>, 0, sizeof...(Tys)-1>::print(os, t); os << "}"; return os; }

template<typename A, size_t N, typename T> inline void Fill(A(&array)[N], const T &val) { std::fill((T*)array, (T*)(array + N), val); }

void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) { DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...); }

#define PI 3.14159265358979323846
#define EPS 1e-11
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define fake false
#ifdef VC
#define scanf scanf_s
#endif

const ll mod=1000000007;


int n;
vector<ll> a;

int main() {
	cin >> n;
	a.resize(n, 0);
	ll max_ = -10000000000;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
		max_ = max(max_, a[i]);
	}
	if (max_ >= 0) {
		ll sum_o = 0, sum_e = 0;

		for (int i = 0; i < n; i += 2) {
			sum_e += max(a[i], 0LL);
		}
		for (int i = 1; i < n; i += 2) {
			sum_o += max(a[i], 0LL);
		}
		bool even;
		vector<int> ans;
		int idx = 0;
		if (sum_e > sum_o) {
			even = true;
			cout << sum_e << endl;
		}
		else {
			even = false;
			cout << sum_o << endl;
			ans.push_back(1);
			a.erase(a.begin());
		}
		if (a.size() % 2 == 0) {
			ans.push_back(a.size());
			a.erase(a.end() - 1);
		}
		int size_a = a.size();
		int temp = 0;
		while (a[temp] < 0) {
			ans.push_back(1);
			ans.push_back(1);
			temp += 2;
			size_a -= 2;
		}
		while (size_a != 1) {
			temp += 2;
			if (a[temp] < 0) {
				ans.push_back(3);
				if (size_a == 3) {
					ans.push_back(2);
				}
			}
			else {
				ans.push_back(2);
			}
			size_a -= 2;
		}
		cout << ans.size() << endl;
		for (auto &&x : ans) {
			cout << x << endl;
		}
	}
	else {
		cout << max_ << endl;
		cout << n - 1 << endl;
		bool flg = false;
		for (int i = 0; i < n; i++) {
			if (flg) {
				printf("1\n");
			}
			else {
				if (a[n-i-1] == max_) {
					flg = true;
				}
				else {
					printf("%d\n", n - i);
				}
			}
		}
	}
	return 0;
}

Measured memory_bytes: 256