|All-time Popular Problems|
|Delete Middle of Linked List|
|Intersection of Two Linked Lists|
|Egg Dropping Puzzle|
|Consecutive 1's not allowed|
|Element with left side smaller and right side greater|
|Merge two sorted linked lists|
|Minimum element in a sorted and rotated array|
|Root to leaf path sum|
|Minimum number of jumps|
Given an integer, check whether it is a palindrome or not.
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.
Print "Yes" or "No" (without quotes) depending on whether the number is palindrome or not.
1 <= T <= 1000
1 <= N <= 10000