#include<bits/stdc++.h> using namespace std; int dp[10000]; int N; int V[10000]; int main(){ cin>>N; for(int i=0;i<N;i++)cin>>V[i]; for(int i=2;i<N+2;i++)dp[i]=max(dp[i-1],dp[i-2]+V[i-2]); vector<int>ans; int cur=N+1; while(cur>1){ if(dp[cur]==dp[cur-1]){ cur--; continue; } cur-=2; ans.push_back(cur+1); } reverse(ans.begin(),ans.end()); cout<<dp[N+1]<<endl; for(int i=0;i<ans.size();i++){ if(i)cout<<" "; cout<<ans[i]; } cout<<endl; return 0; }