/* -*- coding: utf-8 -*-
 *
 * 258.cc: No.258 回転寿司(2) - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 1000;

/* typedef */

/* global variables */

int vs[MAX_N], dp[MAX_N + 2][2], nxts[MAX_N + 2][2];

/* subroutines */

/* main */

int main() {
  int n;
  cin >> n;

  for (int i = 0; i < n; i++) cin >> vs[i];

  dp[n][0] = dp[n][1] = dp[n + 1][0] = dp[n + 1][1] = 0;
  nxts[n][0] = nxts[n][1] = nxts[n + 1][0] = nxts[n + 1][1] = -1;

  for (int i = n - 1; i >= 0; i--) {
    if (dp[i + 1][0] > dp[i + 1][1])
      dp[i][0] = dp[i + 1][0], nxts[i][0] = 0;
    else
      dp[i][0] = dp[i + 1][1], nxts[i][0] = 1;

    if (dp[i + 2][0] > dp[i + 2][1])
      dp[i][1] = vs[i] + dp[i + 2][0], nxts[i][1] = 0;
    else
      dp[i][1] = vs[i] + dp[i + 2][1], nxts[i][1] = 1;
  }

  printf("%d\n", max(dp[0][0], dp[0][1]));

  int nxt = (dp[0][0] > dp[0][1]) ? 0 : 1;
  bool first = true;

  for (int i = 0; i < n;) {
    if (nxt == 1) {
      if (! first) putchar(' ');
      first = false;
      printf("%d", i + 1);
      nxt = nxts[i][nxt], i += 2;
    }
    else
      nxt = nxts[i][nxt], i++;
  }
  putchar('\n');
  return 0;
}