def is_reversible(n):
    if n % 10 == 0:  # Avoid leading zeroes in the reverse
        return False
    
    sum_n_reverse = n + int(str(n)[::-1])  # Sum of n and its reverse
    for digit in str(sum_n_reverse):
        if int(digit) % 2 == 0:  # Check for even digits in the sum
            return False
    return True

def count_reversible_numbers(limit):
    count = 0
    for i in range(1, limit):
        if is_reversible(i):
            count += 1
    return count

def main():
    test_cases = int(input())
    for _ in range(test_cases):
        limit = int(input())
        reversible_count = count_reversible_numbers(limit)
        print(reversible_count)

if __name__ == "__main__":
    main()

n = [int(input()) for i in range(0,int(input()))]
def reverse(x):
    return int(str(x)[::-1])
def isInputOdd(x):
    lis = str(x)
    for i in lis:
        if int(i)%2==0:
            flag = False
            return flag
        else:
            flag = True
    return flag
def main(iter):    
    sum1=0
    for i in range(iter):
        k = i + reverse(i)
        if i%10!=0 and isInputOdd(k):
            sum1+=1
    print (sum1)
for i in n:
    main(i)