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.
N=int(input())
a=list(map(int,input().split()))

sum=0

for A in a:
    sum+=A

print(sum)
N=int(input())
a=list(map(int,input().split()))

A=[0]*N
sum=0
b=[]

for i in range(N,0,-1):
    #print(i)
    count=0
    for j in range(i-1,N,i):
        count+=A[j]
    if count%2==a[i-1]:
        pass
    else:
        A[i-1]=1
        sum+=1
        b.append(i)

print(sum)
if len(b)!=0:
    print(" ".join(map(str,b)))
