In a game with a single pile of $n$ stones, a player can remove any prime number of stones. The player who cannot make a move loses. Let $L_n = 1$ if the first player has a winning strategy, and $0$ otherwise. What is the smallest positive integer $n \geq 2$ for which $L_n = 0$?