Navi and Ozna are playing a game where Ozna starts first and the two take turns making moves. A positive integer is written on the board. A move consists of either:

1. Subtracting any positive integer at most $2015$ from it, or
2. If the integer on the board is divisible by $2014$, dividing 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$ such that $a \geq 2015$, ensuring 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 integers where Navi wins.

Let's think step by step and output the final answer within \boxed{}.
user