List all the divisors of N, including 1 and N, and take turns crossing out a divisor (and all of its divisors that are not yet crossed out). Win by forcing your opponent to cross out the final number on the list. Can you come up with a winning strategy?