use std::io::{Read, Write};

struct Scanner<R> { bytes: std::io::Bytes<R>, buf: Vec<u8> }
 
impl<R: Read> Scanner<R> {
    fn new(r: R) -> Scanner<R> {
        Scanner { bytes: r.bytes(), buf: Vec::new() }
    }
  
    fn next(&mut self) -> &str {
        self.buf = {
            self.bytes.by_ref().map(|b| b.unwrap())
                .skip_while(|b| b.is_ascii_whitespace())
                .take_while(|b| !b.is_ascii_whitespace())
                .collect::<Vec<_>>()
        };
        unsafe { std::str::from_utf8_unchecked(&self.buf) }
    }
}

macro_rules! scan {
    ($sc:expr, [$t:tt; $n:expr]) => (
        (0..$n).map(|_| scan!($sc, $t)).collect::<Vec<_>>()
    );
    ($sc:expr, ($($t:tt),*)) => (($(scan!($sc, $t)),*));
    ($sc:expr, Usize1) => (scan!($sc, usize) - 1);
    ($sc:expr, Bytes) => ($sc.next().bytes().collect::<Vec<_>>());
    ($sc:expr, Chars) => ($sc.next().chars().collect::<Vec<_>>());
    ($sc:expr, $t:ty) => ($sc.next().parse::<$t>().unwrap());
}

fn prime_factorize(mut n: usize) -> Vec<(usize, usize)> {
    let mut res = Vec::new();
    for i in 2.. {
        if i * i > n { break; }
        let mut cnt = 0;
        while n % i == 0 {
            cnt += 1;
            n /= i;
        }
        if cnt > 0 { res.push((i, cnt)); }
    }
    if n > 1 { res.push((n, 1)); }
    res
}

fn euler_f(n: usize) -> usize {
    prime_factorize(n).iter().fold(n, |acc, (i, _)| acc * (i - 1) / i)
}

fn get_divisors(n: usize) -> Vec<usize> {
    let (mut divisors, mut tmp) = (Vec::new(), Vec::new());
    for i in (1..).take_while(|i| i * i <= n) {
        if n % i > 0 { continue; }
        divisors.push(i);
        let j = n / i;
        if j == i { break; }
        tmp.push(j);
    }
    divisors.reserve_exact(tmp.len());
    while let Some(j) = tmp.pop() { divisors.push(j); }
    divisors
}

fn run<R: Read, W: Write>(mut sc: Scanner<R>, mut wr: W) {
    let pow_mod = |mut a: usize, mut n: usize, m: usize| -> usize {
        let mut res = 1;
        while n > 0 {
            if n & 1 > 0 {
                res = res * a % m;
            }
            a = a * a % m;
            n >>= 1;
        }
        res
    };

    for _ in 0..scan!(sc, usize) {
        let mut n = scan!(sc, usize);
        while n % 2 == 0 { n /= 2; }
        while n % 5 == 0 { n /= 5; }
        if n == 1 {
            writeln!(wr, "1").ok();
            continue;
        }
        let m = euler_f(n);
        for i in get_divisors(m) {
            if pow_mod(10, i, n) == 1 {
                writeln!(wr, "{}", i).ok();
                break;
            }
        }
    }
}

fn main() {
    let (stdin, stdout) = (std::io::stdin(), std::io::stdout());
    let sc = Scanner::new(std::io::BufReader::new(stdin.lock()));
    let wr = std::io::BufWriter::new(stdout.lock());
    run(sc, wr);
}