Step 1: Losing positions.
With 1 stick left the player to move must take it and loses. So \( n = 1 \) is a losing position for the mover.
With 2 or 3 sticks left, the mover takes 1 or 2 and leaves exactly 1 stick, so he wins.
With 4 sticks left, whatever the mover takes (1 or 2), he leaves 3 or 2, a winning position for the opponent. So 4 is losing. Continuing, the losing positions for the mover are \( n \equiv 1 \pmod 3 \): 1, 4, 7, 10, ...
Step 2: Apply to the game.
A moves first. B wins exactly when the starting N is a losing position for A, i.e. \( N \equiv 1 \pmod 3 \). (B then always plays so that A and B together remove 3 sticks per round.)
Step 3: Smallest N greater than 5.
\( N = 7 \) (since \( 7 = 3 \times 2 + 1 \)). Among the options, 10 is also of the form \( 3k+1 \) but is larger; 6 and 8 are not of this form.
Final Answer:
The correct option is (2): 7