HMMT 2006 U27

Let $N$ denote the number of subsets of $\{1,2,3, \ldots, 100\}$ that contain more prime numbers than multiples of 4 . Compute the largest integer $k$ such that $2^{k}$ divides $N$.