BETA
School Problem's Submission isn't counted in score!

Submissions: 6463 Accuracy:

38.48%

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 Input/Output Examples Use 'Expected Output' option **

Contributor: Ayush Saluja

Set Default Code

					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

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