There are $$𝑚$$ blue marbles and $$𝑛$$ red marbles on a table. Armaan and Babita play a game by taking turns. In each turn the player has to pick a marble of the colour of his/her choice. Armaan starts first, and the player who picks the last red marble wins. For how many choices of $$(m,n)$$ with $$1 \neq m,n \neq 11$$ can Armaan force a win?