C - Chef and Sequence Sums

Chef has an array $A$ of $N$ integers. Chef wants to find if the array is $GOOD$ or $BAD$. To check if the array is $GOOD$ chef will perform an operation. 1) Select any array $B$ of length $N$ where $B_i$ can be any integer. 2) For Every $A_i$ $(1 \leq i \leq N)$, change it to $A_i := A_i * B_i$. 3) If there is any subsequence of the array $A$ with $sum=1$ then it is $GOOD$ else