EOJ-自适应编程学习平台

Given any integer 0 < = n < = 10000 not divisible by 2 or 5, some multiple of n is a number which in decimal notation is a sequence of 1's. How many digits are in the smallest such a multiple of n?

the first line of input gives the number of cases, T(1 < = T < = 50) T cases follow.

Each case contains an integer n.

Output one line,with the answer described above;