Navi and Ozna are playing a game where Ozna starts first and the two take turn making moves. A positive integer is written on the waord. A move is to (i) subtract any positive integer at most 2015 from it or (ii) given that the integer on the board is divisible by 2014, divide by 2014. The first person to make the integer 0 wins. To make Navi's condition worse, Ozna gets to pick integers a and b, a≥2015 such that all numbers of the form an+b will not be the starting integer, where n is any positive integer.Find the minimum number of starting integer where Navi wins. combinatoricsCombinatorial games