#include <bits/stdc++.h>

using namespace std;
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
#define ten(n) ((int)1e##n)
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;

template<typename ...> static inline int getchar_unlocked(void) { return getchar(); }
template<typename ...> static inline void putchar_unlocked(int c) { putchar(c); }
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
void reader(int& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
void reader(ll& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
int reader(char c[]) { int i, s = 0; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c[s++] = i; for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c[s++] = i; }c[s] = '\0'; return s; }
int reader(string& c) { int i; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c.push_back(i); for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c.push_back(i); }; return sz(c); }
template <class T, class S> void reader(T& x, S& y) { reader(x); reader(y); }
template <class T, class S, class U> void reader(T& x, S& y, U& z) { reader(x); reader(y); reader(z); }
template <class T, class S, class U, class V> void reader(T& x, S& y, U& z, V & w) { reader(x); reader(y); reader(z); reader(w); }
void writer(int x, char c) { int s = 0, m = 0; char f[10]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(ll x, char c) { int s = 0, m = 0; char f[20]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(const char c[]) { int i; for (i = 0; c[i] != '\0'; i++)mypc(c[i]); }
void writer(const string& x, char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
void writer(const char x[], char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
template<class T> void writerLn(T x) { writer(x, '\n'); }
template<class T, class S> void writerLn(T x, S y) { writer(x, ' '); writer(y, '\n'); }
template<class T, class S, class U> void writerLn(T x, S y, U z) { writer(x, ' '); writer(y, ' '); writer(z, '\n'); }
template<class T, class S, class U, class V> void writerLn(T x, S y, U z, V v) { writer(x, ' '); writer(y, ' '); writer(z, ' '); writer(v, '\n'); }
template<class T> void writerArr(T x[], int n) { if (!n) { mypc('\n'); return; }FOR(i, n - 1)writer(x[i], ' '); writer(x[n - 1], '\n'); }
template<class T> void writerArr(vector<T>& x) { writerArr(x.data(), (int)x.size()); }

template<class T> void chmin(T& a, const T& b) { if (a > b) a = b; }
template<class T> void chmax(T& a, const T& b) { if (a < b) a = b; }

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
ll mod_pow(ll a, ll n, ll mod) {
	ll ret = 1;
	ll p = a % mod;
	while (n) {
		if (n & 1) ret = ret * p % mod;
		p = p * p % mod;
		n >>= 1;
	}
	return ret;
}
template<class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b -= q * a, a); } return b; }
ll mod_inv(ll a, ll m) { ll x, y; extgcd<ll>(a, m, x, y); return (m + x % m) % m; }

pair<ll, vector<int>> solve(vector<ll> a) {
	int id = max_element(a.begin(), a.end()) - a.begin();
	ll ret = a[id];
	if (ret < 0) {
		return make_pair(ret, vector<int>({ id }));
	}

	vector<int> idx;
	ll ret2 = 0;
	FOR(i, sz(a)) {
		ll x = a[i];
		if (x > 0) ret2 += x, idx.emplace_back(i);
	}

	return make_pair(ret2, idx);
}

int main() {
	//int n = 12;
	//vector<int> v(n);
	//FOR(i, n) v[i] = 1 << i;
	//queue<vector<int>> q;
	//q.push(v);
	//set<vector<int>> st;
	//st.insert(v);
	//while (!q.empty()) {
	//	auto v = q.front(); q.pop();
	//	if (sz(v) == 1) continue;
	//	FOR(i, sz(v)) {
	//		vector<int> nt = v;
	//		if (0 < i && i < sz(v) - 1) {
	//			nt[i - 1] += nt[i + 1];
	//			nt.erase(nt.begin() + i + 1);
	//		}
	//		nt.erase(nt.begin() + i);
	//		if (st.insert(nt).second) {
	//			q.push(nt);
	//		}
	//	}
	//}

	//for (auto &x : st) {
	//	if (sz(x) == 1) {
	//		vector<int> idx;
	//		FOR(i, n) if (x[0] & (1 << i)) idx.push_back(i);
	//		writerArr(idx);
	//	}
	//}

	int n; reader(n);
	vector<ll> a, b;
	FOR(i, n) {
		int x; reader(x);
		if (i & 1) a.push_back(x);
		else b.push_back(x);
	}

	auto ans1 = solve(a);
	auto ans2 = solve(b);
	ll ansval = max(ans1.first, ans2.first);
	vector<int> aidx;
	if (ansval == ans1.first) {
		for (auto x : ans1.second) aidx.push_back(x * 2 + 1);
	} else {
		for (auto x : ans2.second) aidx.push_back(x * 2);
	}

	vector<int> dels;
	for (int i = n - 1; i != aidx.back(); i--) dels.push_back(i);
	FOR(i, sz(aidx) - 1) {
		int nidx = sz(aidx) - 1 - i;
		int pidx = nidx - 1;
		int diff = aidx[nidx] - aidx[pidx];
		int md = (aidx[nidx] + aidx[pidx]) / 2;
		FOR(i, diff / 2) {
			dels.push_back(md);
			md--;
		}
	}
	FOR(i, aidx[0]) {
		dels.push_back(0);
	}

	writerLn(ansval);
	writerLn(sz(dels));
	for (auto& x : dels) {
		writerLn(x + 1);
	}

	return 0;
}

Measured memory_bytes: 256