Moushi is a very serious competitive programmer. As ICPC is approaching, her coach assigns her a strict training rule: she must solve an even number of problems every day.
To stay on track, she writes down her target solve count for the next $$$T$$$ days $$$X_1, X_2, \dots, X_T$$$ and goes to sleep.
However, she wakes up to find that the digit 9 has completely vanished from the world, making the number system consisting only of digits $$$0$$$ to $$$8$$$. Because of this change, she can no longer decide whether a number is even or odd by simply checking its last digit.
To ensure that her target of the day complies with the coach's requirement, Moushi needs to re-evaluate all the numbers under this new base-$$$9$$$ numeral system.
The first line contains a single integer $$$T$$$ ($$$1 \le T \le 10^3$$$) — the number of days.
The $$$i$$$-th of the next $$$T$$$ lines contains two space-separated integers $$$n_i$$$ and $$$X_i$$$ ($$$1 \le n_i \le 10^5$$$), where $$$n_i$$$ is the number of digits in $$$X_i$$$, and $$$X_i$$$ is the number of problems (in base-$$$9$$$) Moushi needs to solve on day $$$i$$$.
It is guaranteed that $$$X_i$$$ does not contain leading zeros.
It is also guaranteed that the sum of $$$n_i$$$ over all days does not exceed $$$10^5$$$.
For each day, output "YES" if the goal for that day is valid, "NO" otherwise.
You can output the answer in any case (upper or lower). For example, the strings "yEs", "yes", "Yes", and "YES" will be recognized as positive responses.
51 84 12345 1234532 1234567812345678123456781234567820 12345671234567123456
YESYESNOYESNO
