import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
T[] ARR(T = long)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }
T[] RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[][] RDA2(T = long)(size_t n, T[] fix = []) { auto r = new T[][](n); foreach (i; 0..n) { r[i] = readln.chomp.split.to!(T[]); foreach (j, e; fix) r[i][j] += e; } return r; }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
long lcm(long x, long y) { return x * y / gcd(x, y); }

long mod = 10^^9 + 7;
//long mod = 998244353;
//long mod = 1_000_003;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

void main()
{
	auto N = RD;
	auto A = new double[](N);
	foreach (i; 0..N)
	{
		A[i] = log2(cast(double)RD);
	}
	debug writeln(A);
	auto B = new double[](N+1);	
	auto C = new double[](N+1);
	B[] = 0.0;
	C[] = 0.0;
	foreach (i; 0..N)
	{
		B[i+1] = B[i] + A[i];
	}
	foreach_reverse (i; 0..N)
	{
		C[i] = C[i+1] + A[i];
	}
	debug writeln(B);
	debug writeln(C);

	auto Q = RD;
	foreach (i; 0..Q)
	{
		auto rawP = RD;
		auto P = log2(cast(double)rawP);
		auto L = RD-1;
		auto R = RD-1;
		auto x = B[R+1] - B[L];
		auto y = x / P;
		auto z = y - cast(long)y;
		debug writeln(B[R+1], " ", B[L], " ", x, " ", y, " ", z, " ", P^^z);
		if (x.isNaN)
			writeln("NO");
		else if (rawP == 1)
			writeln("Yes");
		else if (x == 0.0)
			writeln("NO");
		else if (P^^z == cast(long)(P^^z))
		{
			writeln("Yes");
		}
		else
		{
			writeln("NO");
		}
	}

	stdout.flush();
	debug readln();
}