import sys #input = sys.stdin.readline input = sys.stdin.buffer.readline #文字列はダメ #sys.setrecursionlimit(1000000) #import bisect #import itertools #import random #from heapq import heapify, heappop, heappush #from collections import defaultdict #from collections import deque #import copy #import math #from functools import lru_cache #@lru_cache(maxsize=None) #MOD = pow(10,9) + 7 #MOD = 998244353 #dx = [1,0,-1,0] #dy = [0,1,0,-1] #dx8 = [1,1,0,-1,-1,-1,0,1] #dy8 = [0,1,1,1,0,-1,-1,-1] def main(): T = int(input()) for _ in range(T): n = int(input()) flag = False for nn in range(1,10): if flag: break base = pow(10,nn) - 1 v = 0 while v*v <= base: v += 1 if base%v != 0: continue u = base//v mp = (v-1) * n #print(v,mp) if mp > 0 and len(str(mp)) == nn: print(mp) flag = True break mp = (u-1) * n #print(v,mp) if mp > 0 and len(str(mp)) == nn: print(mp) flag = True break if __name__ == '__main__': main()