BETA

Difficulty Level: Easy

Submissions: 348 Accuracy:

41.38%

Generate all palindromic numbers less than n
     

Count the number of palindromic numbers less than N.

Input:

The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains the integer N.


Output:

Print the count of all palindromic numbers less than N. Print the answer for each test case in a new line.


Constraints:

1<= T <=100

1<= N <=100000


Example:

Input:

2

12

104

Output:

10

19

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

Contributor: Sujnesh Mishra

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.