Contrapositive and Contradiction · Hard problem

"If $2^n - 1$ is prime, then $n$ is prime" is best proved by contrapositive (a composite $n = rs$ makes $2^r - 1$ a factor). For how many $n$ with $1 \le n \le 20$ is $2^n - 1$ prime?