Proof Writing & Problem Solving · Superchallenge problem

A proof shows $7 \nmid 2^n + 1$ for every $n \ge 1$ by cases on $n \bmod 3$. Generalising, for how many primes $p < 50$ does $p$ divide $2^n + 1$ for SOME positive integer $n$?