CF1676A.Lucky?

A ticket is a string consisting of six digits. A ticket is considered lucky if the sum of the first three digits is equal to the sum of the last three digits. Given a ticket, output if it is lucky or not. Note that a ticket can have leading zeroes.

一张票是一个由六位数字组成的字符串。如果该票的前三位数字之和等于后三位数字之和，则称这张票为“幸运票”。给定一张票，请输出它是否为幸运票。注意：票号可以包含前导零。

The first line of the input contains an integer $t$ ($1 \leq t \leq 10^3$) — the number of testcases.

The description of each test consists of one line containing one string consisting of six digits.

输入的第一行包含一个整数 $t$（$1 \leq t \leq 10^3$）—— 表示测试用例的数量。

每个测试用例的描述由一行组成，该行包含一个由六个数字组成的字符串。

Output $t$ lines, each of which contains the answer to the corresponding test case. Output "YES" if the given ticket is lucky, and "NO" otherwise.

You can output the answer in any case (for example, the strings "yEs", "yes", "Yes" and "YES" will be recognized as a positive answer).

输出 $t$ 行，每行包含对应测试用例的答案。如果给定的车票是幸运车票，则输出 "YES"，否则输出 "NO"。

答案的大小写不限（例如，字符串 "yEs"、"yes"、"Yes" 和 "YES" 均会被识别为肯定回答）。

In the first test case, the sum of the first three digits is $2 + 1 + 3 = 6$ and the sum of the last three digits is $1 + 3 + 2 = 6$, they are equal so the answer is "YES".

In the second test case, the sum of the first three digits is $9 + 7 + 3 = 19$ and the sum of the last three digits is $8 + 9 + 4 = 21$, they are not equal so the answer is "NO".

In the third test case, the sum of the first three digits is $0 + 4 + 5 = 9$ and the sum of the last three digits is $2 + 0 + 7 = 9$, they are equal so the answer is "YES".

在第一个测试用例中，前三位数字之和为 $2 + 1 + 3 = 6$，后三位数字之和为 $1 + 3 + 2 = 6$，二者相等，因此答案为 "YES"。

在第二个测试用例中，前三位数字之和为 $9 + 7 + 3 = 19$，后三位数字之和为 $8 + 9 + 4 = 21$，二者不相等，因此答案为 "NO"。

在第三个测试用例中，前三位数字之和为 $0 + 4 + 5 = 9$，后三位数字之和为 $2 + 0 + 7 = 9$，二者相等，因此答案为 "YES"。