Palindromic Number Rearrangement

You are given a series of integers. For each integer, determine if the digits can be rearranged to form a palindrome.

A palindrome is a number that reads the same backward as forward, for example, 121 or 1221. The task is to decide whether the digits of the given integer can be permuted (reordered) to form such a palindrome.

In other words, you need to check if at most one digit occurs an odd number of times in the string representation of the integer. If this condition is met, output "Yes"; otherwise, output "No".

The input is read from standard input and the output should be printed to standard output.

inputFormat

The first line contains a single integer T, which denotes the number of test cases.

Then T lines follow, each line contains a single non-negative integer N.

Example:

3
121
1234
4444

outputFormat

For each test case, output a single line with the answer: "Yes" if the digits of N can be rearranged to form a palindrome, otherwise "No".

Example:

Yes
No
Yes

## sample

3
121
1234
4444

Yes
No
Yes

</p>