[ $[\underline{\text { Games-jokes }}]$

On the board, the numbers 25 and 36 are written. In one move, it is allowed to write down another natural number - the difference between any two numbers already on the board, if it has not appeared before. The player who cannot make a move loses.

#
In the process of the game (compare with Euclid's algorithm), the greatest common divisor of the initial numbers will definitely be written out. Consequently, all numbers that are multiples of it, not exceeding the larger of the initial numbers, will also be written out. In our case, the GCD is 1. Therefore, all numbers from 1 to 36 will be written out. Thus, the game will continue for 34 moves (two numbers were written at the beginning), and the second player wins.