BETA
Successful submissions of School Problems are not counted in user ratings.

Submissions : 5915 Accuracy :

37.31

Palindrome
     

Given an integer, check whether it is a palindrome or not.
Input:
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case consists of a single line. The first line of each test case contains a single integer N to be checked for palindrome.

Output:
Print "Yes" or "No" (without quotes) depending on whether the number is palindrome or not.


Constraints:
1 <= T <= 1000
1 <= N <= 100
00

Example:
Input:
3
6
167

55555

Output:
Yes
No

Yes

**For More Examples Use Expected Output**


Contributor: Ayush Saluja

Set Default Code

					   
Result:
It is recommended to 'Test' your code before clicking 'Submit' button!



                   



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.