#define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <utility>
#include <complex>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <deque>
#include <tuple>
#include <bitset>
#include <limits>
#include <algorithm>
#include <random>
#include <complex>
#include <regex>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef complex<ld> compd;
#define quickIO()	{cin.tie(0);	cout.sync_with_stdio(false);}
#define reach(i,a)	for(auto i:a)
#define rep(i,n)	for(int i=0;i<(int)n;i++)
#define REP(i,n)	for(int i=0;i<=(int)n;i++)
#define srep(i,a,n)	for(int i=a;i<(int)n;i++)
#define SREP(i,a,n)	for(int i=a;i<=(int)n;i++)
#define rrep(i,n)	for(int i=n-1;i>=0;i--)
#define RREP(i,n)	for(int i=n;i>=0;i--)
#define all(a)	(a).begin(),(a).end()
#define mp(a,b)	make_pair(a,b)
#define mt	make_tuple
#define pb	push_back
#define fst	first
#define scn second
int bitcnt(ll x) {
	x = ((x & 0xAAAAAAAAAAAAAAAA) >> 1) + (x & 0x5555555555555555);
	x = ((x & 0xCCCCCCCCCCCCCCCC) >> 2) + (x & 0x3333333333333333);
	x = ((x & 0xF0F0F0F0F0F0F0F0) >> 4) + (x & 0x0F0F0F0F0F0F0F0F);
	x = ((x & 0xFF00FF00FF00FF00) >> 8) + (x & 0x00FF00FF00FF00FF);
	x = ((x & 0xFFFF0000FFFF0000) >> 16) + (x & 0x0000FFFF0000FFFF);
	x = ((x & 0xFFFFFFFF00000000) >> 32) + (x & 0x00000000FFFFFFFF);
	return x;
}
int bitcnt(int x) {
	x = ((x & 0xAAAAAAAA) >> 1) + (x & 0x55555555);
	x = ((x & 0xCCCCCCCC) >> 2) + (x & 0x33333333);
	x = ((x & 0xF0F0F0F0) >> 4) + (x & 0x0F0F0F0F);
	x = ((x & 0xFF00FF00) >> 8) + (x & 0x00FF00FF);
	x = ((x & 0xFFFF0000) >> 16) + (x & 0x0000FFFF);
	return x;
}
ll gcd(ll a, ll b) {
	return a%b == 0 ? b : gcd(b, a%b);
}
#define debug(x)	cout<<"case #" << x << ": " << endl
#define DEBUG 0
const ll inf = 1e18;
const ll mod = 1e9 + 7;
const ld eps = 1e-15;
const int dx[] = { 1,0,-1,0,0 };
const int dy[] = { 0,1,0,-1,0 };

int main() {
	int n;	cin >> n;
	vll a(n);
	rep(i, n)	cin >> a[i];
	bool minus = true;
	rep(i, n)	if (a[i] > 0LL)	minus = false;
	if (minus) {
		// 一番大きい要素以外全削除
		int x = 0;
		rep(i, n)	if (a[x] < a[i])	x = i;
		cout << a[x] << endl;
		cout << n - 1 << endl;
		for (int i = n; i > x + 1; i--)	cout << i << endl;
		for (int i = x; i > 0; i--)	cout << 1 << endl;
		return 0;
	}
	ll ret1 = 0, ret2 = 0;
	for (int i = 0; i < n; i += 2)	ret1 += max(0LL, a[i]);
	for (int i = 1; i < n; i += 2)	ret2 += max(0LL, a[i]);
	vint ret;
	if (ret1 < ret2) {
		ret1 = ret2;
		ret.push_back(1);
		n--;
		a.erase(a.begin());
	}
	if (n % 2 == 0) {
		ret.push_back(n);
		n--;
	}
	while (a[n - 1] <= 0) {
		ret.push_back(n);
		n--;
		ret.push_back(n);
		n--;
	}
	while (n > 1) {
		while (n >= 5 && a[n - 3] <= 0) {
			ret.push_back(n - 2);
			n -= 2;
		}
		if (n == 1)	break;
		else if (n == 3) {
			if (a[0] >= 0) {
				ret.push_back(2);
				n = 1;
				break;
			}
			else {
				ret.push_back(1);
				ret.push_back(1);
				n = 1;
				break;
			}
		}
		else {
			ret.push_back(n - 1);
			n -= 2;
		}
	}
	cout << ret1 << endl;
	cout << ret.size() << endl;
	rep(i, ret.size())	cout << ret[i] << endl;
	return 0;
}

Measured memory_bytes: 256