Olympiad Number Theory · Superchallenge problem

How many subsets of $\{1, 2, \ldots, 12\}$ (including the empty set) have a sum of elements divisible by $3$?