Cow Digit Game

Bessie is playing a number game against Farmer John, and she wants you to help her win.

Each game starts with an integer $N$ ($1 \le N \le 1{,}000{,}000$). Bessie moves first, and the two players then alternate turns. On each turn, the current player subtracts either the largest digit or the smallest non-zero digit of the current number from that number. For example, from $3014$ a player may subtract either $1$ or $4$, reaching $3013$ or $3010$. Play continues until the number becomes $0$; the player who makes the last move (the one who reaches $0$) wins.

Bessie and Farmer John play $G$ games ($1 \le G \le 100$). For each game, decide whether Bessie or Farmer John wins, assuming both play optimally: on every turn a player who has a move that guarantees a win will make such a move.

As an illustration, suppose $N = 13$. Bessie moves first and subtracts $3$, leaving $10$. Farmer John is forced to subtract $1$, leaving $9$. Bessie subtracts $9$, reaching $0$, and wins.

• Line $1$: a single integer $G$.
• Lines $2 \ldots G+1$: line $i+1$ contains a single integer $N_i$, the starting number of game $i$.

• Lines $1 \ldots G$: line $i$ contains "YES" if Bessie wins game $i$, and "NO" otherwise.

With the starting number $9$, Bessie subtracts $9$ and wins immediately. With the starting number $10$, Bessie must subtract $1$ (she cannot subtract $0$), leaving $9$; Farmer John then subtracts $9$ and wins, so Bessie loses.