#include<bits/stdc++.h>
using namespace std;
int dp[1005];
int main(){
	int n;
	cin>>n;
	int v[n+1];
	for(int i=1;i<=n;i++)cin>>v[i];
	dp[1]=v[1],dp[2]=v[2];
	vector<int> ans[n+1];
	ans[1].push_back(1);
	ans[2].push_back(2);
	if(n==1)
	{
		cout<<v[1]<<endl;
		cout<<1<<endl;
		return 0;
	}
	if(n==2)
	{
		if(v[1]>v[2])
		{
			cout<<v[1]<<endl<<1<<endl;
		}else{
			cout<<v[2]<<endl<<2<<endl;
		}
		return 0;
	}
//	cout<<dp[2]<<endl;
	for(int i=3;i<=n;i++)
	{
//		cout<<"i = "<<i<<endl;
		dp[i]=dp[i-1];
		ans[i]=ans[i-1];
		for(int j=i-2;j>=1;j--)
		{
//			cout<<dp[j]<<endl;
			if(dp[j]+v[i]>dp[i])
			{
				dp[i]=dp[j]+v[i];
				ans[i].clear();
				ans[i]=ans[j];
				ans[i].push_back(i);
			}
//			cout<<dp[i]<<endl;
		}
		
	}
	if(dp[n]>dp[n-1])
	{
		cout<<dp[n]<<endl;
		sort(ans[n].begin(),ans[n].end());
		for(int i=0;i<ans[n].size();i++)cout<<ans[n][i]<<" ";
	}else{
		cout<<dp[n-1]<<endl;
		sort(ans[n-1].begin(),ans[n-1].end());
		for(int i=0;i<ans[n-1].size();i++)cout<<ans[n-1][i]<<" ";
	}
	cout<<endl;
	return 0;
}