Induction · Challenge problem

Two players alternately take $1$, $2$ or $3$ stones from a pile; whoever takes the last stone wins. Strong induction shows the losing positions (for the player to move) are exactly the multiples of $4$. With $2026$ stones, how many should the first player take?