--description--

Let $S = \{2, 3, 5, \ldots, 4999\}$ be the set of prime numbers less than 5000.

Find the number of subsets of $S$, the sum of whose elements is a prime number.

Enter the rightmost 16 digits as your answer.

--hints--

primeSubsetSums() should return 9275262564250418.

assert.strictEqual(primeSubsetSums(), 9275262564250418);

--seed--

--seed-contents--

function primeSubsetSums() {

  return true;
}

primeSubsetSums();

--solutions--

// solution required