Two players play a game with an integer n. On each turn, the current player chooses a proper divisor d of n (where 1 <= d < n) and replaces n with n - d. The player who makes the number become 0 wins.

A proper divisor of n is any positive divisor of n that is strictly less than n. Both players play optimally. Given the initial integer n, determine whether the first player can force a win.