A stone game is between two smart players $($A and and is played with three heaps of stones, each with $2023,2024,2025$ stones respectively. The two players $($A is making the first$-$move$)$ alternate taking some number of stones from the three heaps, according to the below rule $(*).$ The player who cannot do this loses.Rule $(*)$: one player must take $2$ stones from one heap, $1$ stone from another heap, and $0$ stones from the third heap. There are six $($i$.$e$.3!)$ possible first$-$moves for A$.$How many of the six moves can ensure A wins this game?