Reverse Numbers

Numbers have many interesting properties. In this problem we look at one of them.

First, let us define the reverse of a number. For a number $N$ written in decimal as $a_n \dots a_1 a_0$, its reverse is the number $a_0 a_1 \dots a_n$ obtained by writing the digits in the opposite order; we denote it $\mathrm{Rev}(N)$. Any leading zeros produced this way are dropped. For example, $\mathrm{Rev}(123) = 321$ and $\mathrm{Rev}(7400) = 47$.

You are given several natural numbers. For each number $M$, decide whether there exists a natural number $N$ such that $M = N + \mathrm{Rev}(N)$.

The input consists of at most 10001 lines. Each line contains one positive integer with fewer than 10000 digits. The last line contains the number $0$, which must not be processed.

For each number $M$ in the input, print YES on its own line if there exists a natural number $N$ with $M = N + \mathrm{Rev}(N)$, and NO otherwise.