Gennady's tour to India

0

0 votes
Very-Easy
Problem

Gennady Korotkevich aka tourist comes to a India for a great tournament.He is very fond his favourite puzzle.The puzzle is :

He has a list of names of all his friends, Now he always tries to find out whether he can make a pallindromic string using the first character of the names of all his friends
But eventually Gennady decides to challenge you to solve this puzzle.

So given a string consisting of first character of the all the names of his friends. If you can make a pallindrome using this string then print "Yes" (Without quotes) otherwise print "No" (without quotes)

INPUT FORMAT

First line contain a single integer T, the number of test cases
then next T lines contains a single string consisting only lowercase alpabetic characters.
OUTPUT FORMAT

For every test case, print "Yes" or "No" 
CONSTRAINTS 

1<=T<=100
1<=length of string <=100
Sample Input
2
axabbc
aaa
Sample Output
No
Yes
Time Limit: 1
Memory Limit: 256
Source Limit:
Editor Image

?