#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::{Write, BufWriter};
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, [ $t:tt ]) => {{
        let len = read_value!($next, usize);
        (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    }};

    ($next:expr, $t:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused)]
macro_rules! debug {
    ($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap());
}
#[allow(unused)]
macro_rules! debugln {
    ($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap());
}

fn calc(mut a: Vec<(i64, usize)>) -> (i64, Vec<usize>) {
    a.sort();
    a.reverse();
    if a[0].0 < 0 {
        return (a[0].0, vec![a[0].1]);
    }
    let mut sum = 0;
    let mut idx = vec![];
    for a in a {
        if a.0 > 0 {
            sum += max(a.0, 0);
            idx.push(a.1);
        }
    }
    idx.sort();
    (sum, idx)
}

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {
        ($($format:tt)*) => (write!(out,$($format)*).unwrap());
    }
    input! {
        n: usize,
        a: [i64; n],
    }
    let mut ma = (i64::min_value(), vec![]);
    for i in 0..2 {
        let mut v = vec![];
        for j in 0..n {
            if j % 2 == i {
                v.push((a[j], j));
            }
        }
        ma = max(ma, calc(v));
    }
    puts!("{}\n", ma.0);
    let m = ma.1.len();
    let mut ops = vec![];
    for i in (ma.1[m - 1] + 1..n).rev() {
        ops.push(i + 1);
    }
    for i in (0..m - 1).rev() {
        let d = (ma.1[i + 1] - ma.1[i]) / 2;
        for _ in 0..d - 1 {
            ops.push(ma.1[i] + 3);
        }
        ops.push(ma.1[i] + 2);
    }
    for _ in 0..ma.1[0] {
        ops.push(1);
    }
    puts!("{}\n", ops.len());
    for o in ops {
        puts!("{}\n", o);
    }
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}


Measured memory_bytes: 8572