Two players, $A$ and $B$, take turns naming positive integers, with $A$ playing first. No player may name an integer that can be expressed as a linear combination, with positive integer coefficients, of previously named integers. The player who names 1 loses. Show that no matter how A and B play, the game will always end.