10. In a row of wooden cells containing several balls, two players, A and B, take turns moving the balls. The movement rules are: each person can choose any number of balls from a certain cell and move them to the cell immediately to the right; when all the balls are moved to the far-right cell, the game ends, and the player who moves the last ball wins.
Given the situation shown in the figure (the numbers in the cells represent the number of balls, and the numbers below the cells indicate the cell numbers), the first player has a winning strategy. To ensure victory, the first player should move $\qquad$ balls from cell $\qquad$ in the first step.
The strategy for this game's problem is the utilization of oddness.
As long as the number of balls in grid 3 and grid 1 are made the same, a sure win can be ensured.
Therefore, to ensure victory, the first player must move the 2 balls from grid 1 into grid 0.
No matter how the second player moves, it will result in the two grids having different numbers of balls. The first player only needs to keep the two grids the same to win in the end.