fn pow_mod(r: u64, mut n: u64, m: u32) -> u64 { assert!(m > 0); if m == 1 { return 0; } let m = m as u64; let mut t = 1; let mut s = r % m; while n > 0 { if n & 1 == 1 { t = t * s % m; } s = s * s % m; n >>= 1; } t } fn factorize(mut n: u64) -> Vec<(u64, u32)> { let mut res = vec![]; for k in 2.. { if k * k > n { break; } let mut c = 0; while n % k == 0 { n /= k; c += 1; } if c > 0 { res.push((k, c)); } } if n > 1 { res.push((n, 1)); } res } // ---------- begin input macro ---------- // reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 macro_rules! input { (source = $s:expr, $($r:tt)*) => { let mut iter = $s.split_whitespace(); input_inner!{iter, $($r)*} }; ($($r:tt)*) => { let s = { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); s }; let mut iter = s.split_whitespace(); input_inner!{iter, $($r)*} }; } macro_rules! input_inner { ($iter:expr) => {}; ($iter:expr, ) => {}; ($iter:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($iter, $t); input_inner!{$iter $($r)*} }; } macro_rules! read_value { ($iter:expr, ( $($t:tt),* )) => { ( $(read_value!($iter, $t)),* ) }; ($iter:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($iter, $t)).collect::>() }; ($iter:expr, chars) => { read_value!($iter, String).chars().collect::>() }; ($iter:expr, bytes) => { read_value!($iter, String).bytes().collect::>() }; ($iter:expr, usize1) => { read_value!($iter, usize) - 1 }; ($iter:expr, $t:ty) => { $iter.next().unwrap().parse::<$t>().expect("Parse error") }; } // ---------- end input macro ---------- fn run() { input! { t: usize, ask: [u64; t], } for mut n in ask { while n % 2 == 0 { n /= 2; } while n % 5 == 0 { n /= 5; } if n == 1 { println!("1"); continue; } let f = factorize(n); let mut phi = f.into_iter().fold(1, |s, a| s * (a.0 - 1) * a.0.pow(a.1 - 1)); let f = factorize(phi); let r = 10 % n; for (p, _) in f { while phi % p == 0 && pow_mod(r, phi / p, n as u32) == 1 { phi /= p; } } println!("{}", phi); } } fn main() { run(); }