import java.io.*; import java.util.*; import java.math.*; // import java.awt.Point; public class Main { InputStream is; PrintWriter out; String INPUT = ""; // static int mod = 1_000_000_007; int mod = 998244353; // long inf = Long.MAX_VALUE/2; int inf = Integer.MAX_VALUE/2; void solve(){ int n = ni(); int[] a = new int[n]; for(int i = 0; i < n; i++){ a[i] = ni(); } int[] primes = sieveEratosthenes(3000); HashMap map = new HashMap<>(); for(int i = 0; i < primes.length; i++){ // System.err.println(primes[i]); map.put(primes[i],i); } int[][] cum = new int[n+1][primes.length]; int[] zeros = new int[n+1]; for(int i = 0; i < n; i++){ int[][] ret = factor(a[i],primes); for(int j = 0; j < primes.length; j++){ cum[i+1][j] = cum[i][j]; } zeros[i+1] = zeros[i]; if(a[i]==0){ zeros[i+1]++; continue; } for(int j = 0; j < ret.length; j++){ cum[i+1][map.get(ret[j][0])] += ret[j][1]; // out.println(ret[j][0]+" "+ret[j][1]+" "+cum[i+1][map.get(ret[j][0])]); } } int q = ni(); outer: for(int i = 0; i < q; i++){ int p = ni(); int l = ni()-1; int r = ni()-1; int[][] tmp1 = factor(p,primes); for(int j = 0; j < tmp1.length; j++){ if(tmp1[j][0]>=2000){ out.println("NO"); continue outer; } int s = tmp1[j][1]; int t = cum[r+1][map.get(tmp1[j][0])] - cum[l][map.get(tmp1[j][0])]; // out.println(s+" "+t+" "+tmp1[j][0]); int z = zeros[r+1] - zeros[l]; if(s>t || z>0){ out.println("NO"); continue outer; } } out.println("Yes"); } } public static int[][] factor(int n, int[] primes) { int[][] ret = new int[10][2]; int rp = 0; for(int p : primes){ if(p * p > n)break; int i; for(i = 0;n % p == 0;n /= p, i++); if(i > 0){ ret[rp][0] = p; ret[rp][1] = i; rp++; } } if(n != 1){ ret[rp][0] = n; ret[rp][1] = 1; rp++; } return Arrays.copyOf(ret, rp); } public static int[] sieveEratosthenes(int n) { if (n <= 32) { int[] primes = { 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 }; for (int i = 0; i < primes.length; i++) { if (n < primes[i]) { return Arrays.copyOf(primes, i); } } return primes; } int u = n + 32; double lu = Math.log(u); int[] ret = new int[(int) (u / lu + u / lu / lu * 1.5)]; ret[0] = 2; int pos = 1; int[] isnp = new int[(n + 1) / 32 / 2 + 1]; int sup = (n + 1) / 32 / 2 + 1; int[] tprimes = { 3, 5, 7, 11, 13, 17, 19, 23, 29, 31 }; for (int tp : tprimes) { ret[pos++] = tp; int[] ptn = new int[tp]; for (int i = (tp - 3) / 2; i < tp << 5; i += tp) ptn[i >> 5] |= 1 << (i & 31); for (int j = 0; j < sup; j += tp) { for (int i = 0; i < tp && i + j < sup; i++) { isnp[j + i] |= ptn[i]; } } } // 3,5,7 // 2x+3=n int[] magic = { 0, 1, 23, 2, 29, 24, 19, 3, 30, 27, 25, 11, 20, 8, 4, 13, 31, 22, 28, 18, 26, 10, 7, 12, 21, 17, 9, 6, 16, 5, 15, 14 }; int h = n / 2; for (int i = 0; i < sup; i++) { for (int j = ~isnp[i]; j != 0; j &= j - 1) { int pp = i << 5 | magic[(j & -j) * 0x076be629 >>> 27]; int p = 2 * pp + 3; if (p > n) break; ret[pos++] = p; if ((long) p * p > n) continue; for (int q = (p * p - 3) / 2; q <= h; q += p) isnp[q >> 5] |= 1 << q; } } return Arrays.copyOf(ret, pos); } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); } public static void main(String[] args) throws Exception { new Main().run(); } private byte[] inbuf = new byte[1024]; private int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b) && b != ' ')){ sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private int ni() { int num = 0, b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }