import java.io.PrintWriter
import java.util.*
import kotlin.math.*

fun phi(n: Long): Long {
    var res = n
    var i = 2L
    var m = n
    while (i * i <= m) {
        if (m % i == 0L) {
            res = res / i * (i - 1)
            while (m % i == 0L) {
                m /= i
            }
        }
        i++
    }
    if (m > 1) {
        res = res / m * (m - 1)
    }
    return res
}

fun modpow(a: Long, n: Long, m: Long): Long {
    if (n == 0L) return 1
    if (n == 1L) return a % m
    val pow = modpow(a, n / 2, m)
    var res = pow * pow % m
    if (n % 2 == 1L) {
        res *= a
        res %= m
    }
    return res
}

fun PrintWriter.solve() {
    val numCases = nextInt()
    case@ for (_i in 0 until numCases) {
        var n = nextLong()
        while (n % 2 == 0L) n /= 2
        while (n % 5 == 0L) n /= 5
        if (n == 1L) {
            println(1)
            continue@case
        }
        val phi = phi(n)
        // region divisors
        val number = phi
        val divs = mutableListOf<Long>()
        var divisor = 1L
        while (divisor * divisor <= number) {
            if (number % divisor == 0L) {
                divs.add(divisor)
                if (divisor * divisor != number) {
                    divs.add(number / divisor)
                }
            }
            divisor++
        }
        divs.sort()
        // endregion
        for (m in divs) {
            if (modpow(10, m, n) == 1L) {
                println(m)
                continue@case
            }
        }
    }
}

fun main() {
    val writer = PrintWriter(System.out, false)
    writer.solve()
    writer.flush()
}

// region Scanner
private var st = StringTokenizer("")
private val br = System.`in`.bufferedReader()

fun next(): String {
    while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())
    return st.nextToken()
}

fun nextInt() = next().toInt()
fun nextLong() = next().toLong()
fun nextLine() = br.readLine()!!
fun nextDouble() = next().toDouble()
// endregion