Olympiad Number Theory · Superchallenge problem

Bertrand's postulate says that for every $n \ge 1$ the interval $(n, 2n]$ contains a prime. Find the largest $n$ for which it contains exactly one.