#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#include <iostream>
#include <cstring>
#include <algorithm>
#include <limits.h>
#include <cmath>
#include <cstdio>
#include <vector>
#include <set>
#include <string>
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
using namespace std;

typedef long long ll;
typedef unsigned long long ull;

int test = 0;
/* ここからが本編 */

class past_memory{
public: 
  vector<int> o; // order
  int v; // value
};

int main(void)
{
  int i,j,k,l;
  int n;
  past_memory past[4];
  cin >> n;
  rep(i,4) {
    past[i].v = 0;
  }
  for(i=1;i<n+1;i++) {
    int v;
    int maxIndex;
    int maxV;

    cin >> v;
    maxIndex = 1;
    maxV = past[1].v;
    rep(j,2) {
      if(maxV < past[j+2].v + v) {
        maxV = past[j+2].v + v;
        maxIndex = j+2;
      }
    }
    past[0].v = maxV;
    past[0].o = past[maxIndex].o;
    if(maxIndex != 1) past[0].o.push_back(i);

    if(test) {
      printf(" %d: ",i);
      printf("v = %d ",v);
      rep(j,4) {
        printf("past[%d].v = %d ",j,past[j].v);
      }
      puts("");
    }
    rep(j,3) {
      past[3-j] = past[3-j-1];
    }
  }
  int maxIndex = 1;
  if(past[1].v < past[2].v) maxIndex = 2;
  cout << past[maxIndex].v << endl;
  printf("%d",past[maxIndex].o[0]);
  for(i=1;i<past[maxIndex].o.size();i++) {
    printf(" %d",past[maxIndex].o[i]);
  }
  puts("");
  
  return 0;
}