#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

int main()
{
    int n;
    cin>>n;
    int niza[n];
    for(int ctr1=0;ctr1<n;ctr1++){
        cin>>niza[ctr1];
    }
    int dp[n];
    memset(dp,0,sizeof(dp));
    for(int ctr1=0;ctr1<n;ctr1++){
        if(ctr1>1)
        {
            dp[ctr1]=max(dp[ctr1],dp[ctr1-2]+niza[ctr1]);
        }
        else dp[ctr1]=max(dp[ctr1],niza[ctr1]);
        if(ctr1>0)
        dp[ctr1]=max(dp[ctr1],dp[ctr1-1]);
    }
    cout<<dp[n-1]<<endl;
    vector<int> rez;
    for(int ctr1=n-1;ctr1>=0;ctr1--){
        if(ctr1>0 && dp[ctr1]==dp[ctr1-1])
            continue;
        else{
            rez.push_back(ctr1+1);
            ctr1--;
        }
    }
    reverse(rez.begin(),rez.end());
    for(int ctr1=0;ctr1<rez.size();ctr1++)
        cout<<rez[ctr1]<<" ";
    cout<<endl;
    return 0;
}