#[allow(unused_imports)] use std::cmp::*; #[allow(unused_imports)] use std::collections::*; use std::io::{Write, BufWriter}; // https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 macro_rules! input { ($($r:tt)*) => { let stdin = std::io::stdin(); let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock())); let mut next = move || -> String{ bytes .by_ref() .map(|r|r.unwrap() as char) .skip_while(|c|c.is_whitespace()) .take_while(|c|!c.is_whitespace()) .collect() }; input_inner!{next, $($r)*} }; } macro_rules! input_inner { ($next:expr) => {}; ($next:expr, ) => {}; ($next:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($next, $t); input_inner!{$next $($r)*} }; } macro_rules! read_value { ($next:expr, ( $($t:tt),* )) => { ( $(read_value!($next, $t)),* ) }; ($next:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($next, $t)).collect::>() }; ($next:expr, chars) => { read_value!($next, String).chars().collect::>() }; ($next:expr, usize1) => { read_value!($next, usize) - 1 }; ($next:expr, [ $t:tt ]) => {{ let len = read_value!($next, usize); (0..len).map(|_| read_value!($next, $t)).collect::>() }}; ($next:expr, $t:ty) => { $next().parse::<$t>().expect("Parse error") }; } mod pollard_rho { use std::collections::HashMap; /// binary gcd pub fn gcd(mut x: i64, mut y: i64) -> i64 { if y == 0 { return x; } if x == 0 { return y; } let mut sh = 0; while ((x | y) & 1) == 0 { x >>= 1; y >>= 1; sh += 1; } while (x & 1) == 0 { x >>= 1; } while y != 0 { while (y & 1) == 0 { y >>= 1; } if x > y { let t = x; x = y; y = t; } y -= x; } x << sh } fn add_mod(x: i64, y: i64, n: i64) -> i64 { let z = x + y; if z >= n { z - n } else { z } } fn mul_mod(x: i64, mut y: i64, n: i64) -> i64 { assert!(x >= 0); assert!(x < n); let mut sum = 0; let mut cur = x; while y > 0 { if (y & 1) == 1 { sum = add_mod(sum, cur, n); } cur = add_mod(cur, cur, n); y >>= 1; } sum } fn mod_pow(x: i64, mut e: i64, n: i64) -> i64 { let mut prod = if n == 1 { 0 } else { 1 }; let mut cur = x % n; while e > 0 { if (e & 1) == 1 { prod = mul_mod(prod, cur, n); } cur = mul_mod(cur, cur, n); e >>= 1; } prod } pub fn is_prime(n: i64) -> bool { if n <= 1 { return false; } let small = [2, 3, 5, 7, 11, 13]; if small.iter().any(|&u| u == n) { return true; } if small.iter().any(|&u| n % u == 0) { return false; } let mut d = n - 1; let mut e = 0; while (d & 1) == 0 { d >>= 1; e += 1; } let a = [2, 325, 9375, 28178, 450775, 9780504, 1795265022]; a.iter().all(|&a| { if a >= n { return true; } let mut x = mod_pow(a, d, n); if x == 1 { return true; } for _ in 0 .. e { if x == n - 1 { return true; } x = mul_mod(x, x, n); if x == 1 { return false; } } x == 1 }) } fn pollard_rho(n: i64, c: &mut i64) -> i64 { if n % 2 == 0 { return 2; } loop { let mut x: i64 = 2; let mut y = 2; let mut d = 1; let cc = *c; let f = |i| add_mod(mul_mod(i, i, n), cc, n); while d == 1 { x = f(x); y = f(f(y)); d = gcd((x - y).abs(), n); } if d == n { *c += 1; continue; } return d; } } /// Outputs (p, e) in p's ascending order. pub fn factorize(x: i64) -> Vec<(i64, usize)> { if x <= 1 { return Vec::new(); } let mut hm = HashMap::new(); let mut pool = vec![x]; let mut c = 1; while let Some(u) = pool.pop() { if is_prime(u) { *hm.entry(u).or_insert(0) += 1; continue; } let p = pollard_rho(u, &mut c); pool.push(p); pool.push(u / p); } let mut v: Vec<_> = hm.into_iter().collect(); v.sort(); v } } // mod pollard_rho fn solve() { let out = std::io::stdout(); let mut out = BufWriter::new(out.lock()); macro_rules! puts { ($($format:tt)*) => (write!(out,$($format)*).unwrap()); } input! { n: usize, a: [i32; n], plr: [(i64, usize1, usize)], } const W: usize = 2000; let mut fac = vec![0; W]; for i in 2..W { fac[i] = i; } for i in 2..W { if fac[i] != i { continue; } for j in 2..(W - 1) / i + 1 { fac[i * j] = i; } } let primes: Vec<_> = (2..W).filter(|&i| fac[i] == i).collect(); let m = primes.len(); let mut inv = vec![0; W]; for i in 0..m { inv[primes[i]] = i; } let mut acc = vec![vec![0i32; n + 1]; m]; for i in 0..n { for j in 0..m { acc[j][i + 1] = acc[j][i]; } let mut v = a[i]; while v > 1 { let p = fac[v as usize]; v /= p as i32; let idx = inv[p]; acc[idx][i + 1] += 1; } } for &(p, l, r) in &plr { let res = pollard_rho::factorize(p); let mut ans = true; for &(p, e) in &res { if p >= W as i64 { ans = false; break; } let idx = inv[p as usize]; let diff = acc[idx][r] - acc[idx][l]; if diff < e as i32 { ans = false; break; } } puts!("{}\n", if ans { "Yes" } else { "NO" }); } } fn main() { // In order to avoid potential stack overflow, spawn a new thread. let stack_size = 104_857_600; // 100 MB let thd = std::thread::Builder::new().stack_size(stack_size); thd.spawn(|| solve()).unwrap().join().unwrap(); }