#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <complex>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <iomanip>
#include <assert.h>
#include <array>
#include <cstdio>
#include <cstring>
#include <random>
#include <functional>
#include <numeric>
#include <bitset>

using namespace std;

#define REP(i,a,b) for(int i=a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define minimize(a, x) a = std::min(a, x)
#define maximize(a, x) a = std::max(a, x)

using ll  = long long;
int const inf = 1<<29;

int main() {

  int N; cin >> N;

  vector<int> v(N);
  rep(i, N) {
    cin >> v[i];
  }

  if(N == 1) {
    cout << v[0] << endl << 1 << endl;
    return 0;
  }

  vector<pair<int, int>> dp(N);
  rep(i, N) {
    dp[i] = {v[i], -1};
  }
  rep(i, N) rep(j, i-1) {
    if(dp[i].first < dp[j].first + v[i]) {
      dp[i] = {dp[j].first + v[i], j};
    }
  }

  /*
  rep(i, dp.size()) {
    cout << dp[i].first << " " << dp[i].second << endl;
  }
  exit(0);
  */

  vector<int> ans;
  if(dp[N-1].first < dp[N].first) {
    cout << dp[N].first << endl;
    int curr = N;
    ans.push_back(N);
    while(dp[curr].second >= 0) {
      ans.push_back(dp[curr].second);
      curr = dp[curr].second;
    }
  }
  else {
    cout << dp[N-1].first << endl;
    int curr = N-1;
    ans.push_back(N-1);
    while(dp[curr].second >= 0) {
      ans.push_back(dp[curr].second);
      curr = dp[curr].second;
    }
  }

  rep(i, ans.size()) {
    if(i) cout << " ";
    cout << ans[(int)ans.size()-1-i] + 1;
  }
  cout << endl;

  return 0;
}