Palindrome
Submissions: 11202   Accuracy:

50%

  Difficulty: School   Marks: 0
*School Problem's Submission isn't counted in score!

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. For each test case there will be single line containing single integer N.

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

Constraints:
1 <= T <= 1000
1 <= N <= 10000

Example:
Input:
3
6
167
55555

Output:
Yes
No
Yes

** For More Input/Output Examples Use 'Expected Output' option **

Author: Ayush Saluja


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



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


to report an issue on this page.