#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cstring>

typedef long long ll;
using namespace std;

#define mod 1000000009
#define INF 10000000
#define LLINF 2000000000000000000LL

#define SIZE 10001

int main(){
    int n,v[1002];
    int dp[1002]={0},ans=0;
    int dp_back[1002]={0};
    vector<int> num;
    
    scanf("%d",&n);
    
    for(int i=2;i<=n+1;i++) scanf("%d",&v[i]);
    
    for(int i=2;i<=n+1;i++){
        for(int j=0;j<=i-2;j++){
            if(dp[i]<dp[j]+v[i]){
                dp[i] = dp[j]+v[i];
                dp_back[i]=j;
            }
        }
        ans =max(dp[i],ans);
    }
    
    int s;
    
    for(s=2;s<=n+1;s++){
        if(ans==dp[s])
            break;
    }
    
    num.push_back(s-1);
    
    while(dp_back[s]>0){
        s = dp_back[s];
        num.push_back(s-1);
    }
    
    printf("%d\n",ans);
    
    for(int i=num.size()-1;i>=0;i--)
        printf(i>0 ? "%d ":"%d\n",num[i]);
    
    return 0;
}