#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF=1e9+10;
const double eps=1e-9;
const int maxn=2e3+10;
ll a[maxn],pre[maxn],Ans[maxn],dp[maxn];
inline ll read(){
	ll x=0,flag=1;
	char ch=getchar();
	while(!isdigit(ch) && ch!='-')ch=getchar();
	if(ch=='-')flag=-1,ch=getchar();
	while(isdigit(ch))x=(x<<3)+(x<<1)+ch-'0',ch=getchar();
	return x*flag;
}
int main(){
	ll i,j,k,m,n;
	n=read();
	for(i=1;i<=n;i++)a[i]=read();
	for(i=1;i<=n;i++)dp[i]=a[i];
	for(i=3;i<=n;i++){
		for(j=i-2;j>=1;j-=2)
			if(dp[i]<dp[j]+a[i]){
				dp[i]=dp[j]+a[i];
				pre[i]=j;
			}
	}
	ll ans=-INF,pos=0;
	for(i=1;i<=n;i++)if(dp[i]>ans)ans=dp[i],pos=i;
	printf("%lld\n",ans);
	int cnt=0,lpos=n;
	if(ans<0){
		for(i=1;i<=n;i++)
			if(a[i]==ans){
				printf("%lld\n",n-1);
				for(j=1;j<i;j++)printf("%lld\n",1);
				for(j=i+1;j<=n;j++)printf("%lld\n",n-j+2);
				return 0;
			}
	}
	else{
		while(pos){
			for(i=lpos;i>=pos+1;i--)Ans[++cnt]=i;
			for(i=pos-2;i>pre[pos];i-=2)Ans[++cnt]=i;
			Ans[++cnt]=pre[pos]+1;
			pos=pre[pos];lpos=pos;
			if(pos==1)break;
		}
	}
	printf("%d\n",cnt);
	for(i=1;i<=cnt;i++)printf("%lld\n",Ans[i]);
	return 0;
}
