class MyLib
  # 素因数分解
  def prime_factorization(num, result = [])
    return [] if num < 1
    return [1] if num==1

    divides = false
    to = Math.sqrt(num).floor
    (2..to).each_with_index do |item, i|
      if num % item == 0
        result << item
        prime_factorization(num / item, result)
        divides = true
        break
      end
    end
    # 何も割れないなら、その数を入れる
    result << num unless divides
    return result
  end

  # 素因数分解ハッシュ形式
  # (例)100なら{2=>2,5=>2}
  def prime_factorization_hash(num)
    arr = prime_factorization(num)
    result = Hash.new(0)
    arr.each do |item|
      result[item] += 1
    end
    result
  end

  # 約数
  # TODO 全体的に変数名が微妙
  def divisors(num)
    pf = prime_factorization_hash(num)
    arrs = []

    # 0乗、1乗・・・した値を入れる
    pf.each_pair do |key, value|
      baisu = []
      (0..value).each do |kai|
        baisu << key**kai
      end

      arrs << baisu
    end

    first_array = arrs.delete_at(0)
    return first_array if arrs.size == 0

    result = first_array.product(*arrs)
    result.map do |item|
      item.inject { |sum, i| sum * i }
    end.sort
  end
end

def main
  n = gets.to_i
  a = gets.split.map(&:to_i)
  res = []
  balls = [0]*n

  a.each_with_index.reverse_each do |rem, i|
    num = i+1
    if (rem + balls[i]) % 2 == 1
      res << [num]
      yaku = MyLib.new.divisors(rem)
      yaku.each do |item|
        balls[item-1] += 1
      end
    end
  end

  m = res.size
  puts m == 0 ? 0 : "#{m}\n#{res.sort.join(' ')}"
end

main