#include <bits/stdc++.h>
using namespace std;

template< class T1, class T2 >
int upmax( T1 &x, T2 v ){
  if( x < v ){
    x = v;
    return 1;
  }
  return 0;
}

signed main(){
  int N; cin >> N;
  vector< int > V( N );
  for( int i = 0; i < N; ++i )
    cin >> V[ i ];
  vector< vector< int > > dp( N + 1, vector< int >( 2, -0x3f3f3f3f ) );
  vector< vector< pair< int, int > > > pre( N + 1, vector< pair< int, int > >( 2, make_pair( -1, -1 ) ) );
  dp[ 0 ][ 0 ] = 0;
  for( int i = 0; i < N; ++i ){
    if( upmax( dp[ i + 1 ][ 0 ], dp[ i ][ 0 ] ) )
      pre[ i + 1 ][ 0 ] = make_pair( i, 0 );
    if( upmax( dp[ i + 1 ][ 0 ], dp[ i ][ 1 ] ) )
      pre[ i + 1 ][ 0 ] = make_pair( i, 1 );
    if( upmax( dp[ i + 1 ][ 1 ], dp[ i ][ 0 ] + V[ i ] ) )
      pre[ i + 1 ][ 1 ] = make_pair( i, 0 );
  }
  cout << max( dp[ N ][ 0 ], dp[ N ][ 1 ] ) << endl;
  stack< int > ans;
  for( int x = N, y = dp[ N ][ 0 ] < dp[ N ][ 1 ]; x > 0; tie( x, y ) = pre[ x ][ y ] )
    if( y )
      ans.emplace( x );
  for( ; not ans.empty(); ans.pop() )
    cout << ans.top() << " \n"[ ans.size() == 1 ];
  return 0;
}