100 人解决，121 人已尝试。
125 份提交通过，共有 354 份提交。
3.2 EMB 奖励。
单点时限: 2.0 sec
内存限制: 256 MB
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;
3 3 7 9901
3 6 12
100 人解决，121 人已尝试。
125 份提交通过，共有 354 份提交。
3.2 EMB 奖励。