Subset Sum 3

You are given an array $A$ of $N$ integers. Determine if their exists a non-empty subsequence$^{\dagger}$ of $A$ such that the sum is divisible by $3$. Print $\text{Yes}$ or $\text{No}$ accordingly. You **do not** need to print an example of such a subset. --- $^{\dagger}$ $B$ is said to be a subset of $A$ if $B$ can be formed by deleting some elements in $A$ without rearranging the order of t