For a positive integer n, two payers a and b play the following game: given a pile of s stones, the players take turn alternatively with a going first. on each turn the player is allowed to take either one stone, or a prime number of stones, or a positive multiple of n stones. the winner is the one who takes the last stone. assuming both a and b play perfectly, for how many values of s the player a cannot win?