#include <bits/stdc++.h>

using namespace std;

// #define int long long
// #define x first
// #define y second
#define File(a) freopen(a".in", "r", stdin), freopen(a".out", "w", stdout)

inline void debug() { cerr << '\n'; }
template<typename Type, typename... Other>
inline void debug(const Type& x, const Other&... y) { cerr << x << ' '; debug(y...); }
#define DEBUG(a...) cerr << "[" << #a << "] = ", debug(a);

typedef long long LL;
typedef pair<int, int> PII;

const int N = 200010;
const int INF = 0x3f3f3f3f;

template<typename Type>
inline void read(Type &res)
{
    res = 0;
    int ch = getchar(), flag = 0;
    while (!isdigit(ch)) flag |= ch == '-', ch = getchar();
    while (isdigit(ch)) res = (res << 3) + (res << 1) + (ch ^ 48), ch = getchar();
    res = flag ? -res : res;
}
template<typename Type, typename... Other>
inline void read(Type &res, Other&... y) { read(res), read(y...); }

int n, m, a[N];

struct SegsTree
{
    #define lc u << 1
    #define rc u << 1 | 1
    struct Node { int l, r, gcd; } tr[N << 2];

    inline void pushup(int u) { tr[u].gcd = __gcd(tr[lc].gcd, tr[rc].gcd); }

    void build(int u, int l, int r)
    {
        tr[u].l = l, tr[u].r = r;
        if (l == r) return tr[u].gcd = a[l], void();
        int mid = l + r >> 1;
        build(lc, l, mid), build(rc, mid + 1, r);
        pushup(u);
    }

    void modify(int u, int x, int k)
    {
        if (tr[u].l == tr[u].r)
            return tr[u].gcd = k, void();
        int mid = tr[u].l + tr[u].r >> 1;
        modify(u << 1 | (x > mid), x, k);
        pushup(u);
    }

    int query(int u, int l, int r)
    {
        if (l <= tr[u].l && tr[u].r <= r)
            return tr[u].gcd;
        int mid = tr[u].l + tr[u].r >> 1, res = 0;
        if (l <= mid) res = query(lc, l, r);
        if (r > mid) res = __gcd(res, query(rc, l, r));
        return res;
    }

    bool find(int u, int l, int r, int k)
    {
        if (tr[u].l == tr[u].r) return true;
        
        if (l <= tr[u].l && tr[u].r <= r)
        {
            if (tr[u].gcd % k != 0)
            {
                if (tr[lc].gcd % k != 0 && tr[rc].gcd % k == 0)
                    return find(lc, l, r, k);
                else if (tr[lc].gcd % k == 0 && tr[rc].gcd % k != 0)
                    return find(rc, l, r, k);
                else return false; 
            }
            else return true;
        }

        int mid = tr[u].l + tr[u].r >> 1, res = true;
        if (l <= mid) res &= find(lc, l, r, k);
        if (r > mid) res &= find(rc, l, r, k);
        return res; 
    }
} SGT;

signed main()
{
    read(n);
    for (int i = 1; i <= n; i ++) read(a[i]);
    SGT.build(1, 1, n);

    read(m);
    int opt, x, y, k;
    while (m --)
    {
        read(opt, x, y);
        if (opt == 1)
        {
            read(k);
            cout << (SGT.find(1, x, y, k) ? "YES" : "NO") << '\n';
        }
        else SGT.modify(1, x, y);
    }
    return 0;
}