using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = NN;
        var a = NList;
        var q = NN;
        var query = NArr(q);
        WriteLine(string.Join("\n", Apple(n, a, q, query).Select(f => f ? "Yes" : "NO")));
    }
    static bool[] Apple(int n, int[] a, int q, int[][] query)
    {
        var p = Enumerable.Repeat(true, 2001).ToArray();
        p[0] = true;
        p[1] = false;
        for (var i = 2; i < p.Length; ++i)
        {
            for (var j = i * 2; j < p.Length; j += i) p[j] = false;
        }
        var plist = new List<int>();
        for (var i = 0; i < p.Length; ++i) if (p[i]) plist.Add(i);
        var cum = new int[n + 1, plist.Count];
        for (var i = 0; i < n; ++i)
        {
            for (var j = 0; j < plist.Count; ++j) cum[i + 1, j] = cum[i, j];
            if (a[i] == 0) ++cum[i + 1, 0];
            else
            {
                var v = a[i];
                for (var j = 1; j < plist.Count; ++j) while (v % plist[j] == 0) { ++cum[i + 1, j]; v /= plist[j]; }
            }
        }
        var ans = new bool[q];
        for (var i = 0; i < q; ++i)
        {
            var v = query[i][0];
            var l = query[i][1] - 1;
            var r = query[i][2];
            if (cum[r, 0] > cum[l, 0]) ans[i] = true;
            else
            {
                for (var j = 1; j < plist.Count; ++j)
                {
                    for (var k = 0; k < cum[r, j] - cum[l, j]; ++k)
                    {
                        if (v % plist[j] == 0) v /= plist[j];
                        else break;
                    }
                }
                ans[i] = v == 1;
            }
        }
        return ans;
    }
}