Palindrome Word Checker

Given a list of words, determine if each word is a palindrome. A palindrome is defined as a string that reads the same forwards and backwards; for instance, \(\texttt{level}\) and \(\texttt{racecar}\) are palindromes while \(\texttt{hello}\) is not.

Your task is to read the input from standard input (stdin) and print the corresponding output to standard output (stdout). For each word, print "Yes" if it is a palindrome, otherwise print "No".

inputFormat

The first line of input contains an integer \(T\) representing the number of words to check. This is followed by \(T\) lines, each containing a single word. Words may be empty and will consist of only visible characters.

outputFormat

Output \(T\) lines. Each line should contain either "Yes" if the corresponding input word is a palindrome or "No" if it is not.

1
level

Yes