Problem:
Score : 400 points

Problem Statement

There are N empty boxes arranged in a row from left to right.
The integer i is written on the i-th box from the left (1 \leq i \leq N).

For each of these boxes, Snuke can choose either to put a ball in it or to put nothing in it.

We say a set of choices to put a ball or not in the boxes is good when the following condition is satisfied:

For every integer i between 1 and N (inclusive), the total number of balls contained in the boxes with multiples of i written on them is congruent to a_i modulo 2.

Does there exist a good set of choices? If the answer is yes, find one good set of choices.

Constraints

All values in input are integers.

1 \leq N \leq 2 \times 10^5

a_i is 0 or 1.

Input

Input is given from Standard Input in the following format:

N
a_1 a_2 ... a_N

Output

If a good set of choices does not exist, print -1.

If a good set of choices exists, print one such set of choices in the following format:

M
b_1 b_2 ... b_M

where M denotes the number of boxes that will contain a ball, and b_1,\ b_2,\ ...,\ b_M are the integers written on these boxes, in any order.

Sample Input 1

3
1 0 0

Sample Output 1

1
1

Consider putting a ball only in the box with 1 written on it.

There are three boxes with multiples of 1 written on them: the boxes with 1, 2, and 3. The total number of balls contained in these boxes is 1.

There is only one box with a multiple of 2 written on it: the box with 2. The total number of balls contained in these boxes is 0.

There is only one box with a multiple of 3 written on it: the box with 3. The total number of balls contained in these boxes is 0.

Thus, the condition is satisfied, so this set of choices is good.

Sample Input 2

5
0 0 0 0 0

Sample Output 2

0

Putting nothing in the boxes can be a good set of choices.

Solution in Rust (1.15.1) (judge verdict: Accepted)

#[allow(dead_code)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($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)*}
    };
}

#[allow(dead_code)]
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)*}
    };

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

#[allow(dead_code)]
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:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}

fn main() {
    input!{
        n: usize,
        mut aa: [u8; n]
    }
    let mut bb: Vec<Option<u8>> = vec![None; n];
    let mut sum: u64 = 0;
    for k in (0..n).rev() {
        let (ia, va) = (k, aa[k]);
        bb[ia] = Some(va);
        sum += va as u64;
        for i in primes(ia + 1) {
            // println!("deb: {} ({})", i, k);
            aa[i - 1] ^= va;
        }
    }
    // let f = |i, bb: &Vec<Option<u8>>| {
    //     bb
    //         .iter()
    //         .enumerate()
    //         .filter_map(|(bi, &bv)| if (bi + 1) % (i + 1) == 0 { bv } else { None })
    //         .fold(0, |sum, b| sum ^ b)
    // };
    // let mut sum: u64 = 0;
    // for (ia, &va) in aa.iter().enumerate().rev() {
    //     let r = f(ia, &bb);
    //     let v = r ^ va;
    //     bb[ia] = Some(v);
    //     sum += v as u64;
    // }





    println!("{}", sum);
    if sum > 0 {
        let bii: Vec<_> = bb.iter().enumerate().filter_map(|(bi, &bv)| {
            let v = match bv {
                Some(v) => v,
                None => return None
            };
            if v == 1 {
                // 0 -> 1, n - 1 -> n
                Some(bi + 1)
            } else {
                None
            }
        }).collect();
        print!("{}", bii[0]);
        for i in bii.iter().skip(1) {
            print!(" {}", i);
        }
        println!("");
    }
}




fn primes(v: usize) -> Vec<usize> {
    let mut ret = vec![1, v];
    let mut i = 2;
    while i * i <= v {
        if v % i == 0 {
            ret.push(i);
            if i * i == v {
                return ret;
            }
            ret.push(v / i);
        }
        i += 1;
    }
    ret
}