#### Solution

In the sequence 1987, 993, 496, 248, 124, 62, 31, 15, 7, 3, each consecutive number is an incomplete quotient left after dividing the previous number by 2 with a remainder. Let us prove that this is a sequence of winning numbers $($ that is, a player who creates one of these numbers has a winning strategy $)$. The number 1987 is a winning number by the condition. Let the number 2k or 2k + 1 $( k > 2)$ be a winning number. Therefore k is also a winning number. Indeed, if one player creates the number k, then the other can only name a number from the interval [k + 1, 2k – 1], after which the first one can name both 2k and 2k + 1. The starting player must name the number 3 and, following this strategy, will win.

#### Answer

The first player.