Special Numbers Problem Statement

Your task is to find the total count of special numbers within a range from 1 to a given integer, 'MAXVAL'. A special number is defined as a number whose digits, when rotated 180 degrees, form another valid number within the same range.

Digits Mapping:

0 -> 0
1 -> 1
6 -> 9
8 -> 8
9 -> 6
Digits 2, 3, 4, 5, 7 remain invalid when rotated.

Example:

Input:

MAXVAL = 8196

Output:

Number of Special Numbers

Explanation:

For instance, '8196' becomes '9618' when rotated 180 degrees and remains valid, making it a special number.

Input:

Integer T denoting the number of test cases.
For each test case, an integer 'MAXVAL' is given.

Output:

For each test case, output an integer representing the count of special numbers between 1 and MAXVAL, printed on a new line.

Constraints:

• 1 <= T <= 10
• 1 <= MAXVAL < 10^4
• Time Limit: 1 second

Note: Implementation does not require printing the results directly; it focuses on logic and functionality.