/*  Erica N  */
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define int long long
#define ull unsigned long long
#define pii pair<int, int>
#define ps second
#define pf first
#define itn int
#define rd read()
int read(){
    int xx = 0, ff = 1;char ch = getchar();
    while (ch < '0' || ch > '9') {if (ch == '-')ff = -1; ch = getchar();}
    while (ch >= '0' && ch <= '9')xx = xx * 10 + (ch - '0'), ch = getchar();
    return xx * ff;
}
// void write(int out) {
// 	if (out < 0)
// 		putchar('-'), out = -out;
// 	if (out > 9)
// 		write(out / 10);
// 	putchar(out % 10 + '0');
// }
#define cdbg(x...) do { cerr << #x << " -> "; err(x); } while (0)
void err() { cerr << endl; }
template<template<typename...> class T, typename t, typename... A>
void err(T<t> a, A... x) { for (auto v: a) cerr << v << ' '; err(x...); }
template<typename T, typename... A>
void err(T a, A... x) { cerr << a << ' '; err(x...); }


const int N = 3e5 + 5;
const int INF = 1e18;
const int M = 1e7;
const int MOD = 1e9 + 7;

int a[N];
namespace SGT{
    int t[N<<2];


    void pushup(int x){
        t[x]=__gcd(t[x<<1],t[x<<1|1]);
    }

    void change(int x,int l,int r,int p,int v){
        if(l==r)return t[x]=v,void();
        int mid=l+r>>1;
        if(p<=mid)change(x<<1,l,mid,p,v);
        else change(x<<1|1,mid+1,r,p,v);
        pushup(x);
    }

    int queryl(int x,int l,int r,int p,int v){
        // cdbg(l,r,t[x]);
        if(t[x]%v==0)return INF;
        if(l==r){
            return t[x]%v==0?INF:l-1;
        }
        int mid=l+r>>1;
        int res=INF;
        if(p<=mid)res=min(res,queryl(x<<1,l,mid,p,v));
        if(res==INF)res=min(res,queryl(x<<1|1,mid+1,r,p,v));
        return res;
    }

    int queryr(int x,int l,int r,int p,int v){
        if(t[x]%v==0)return 0;
        if(l==r){
            return t[x]%v==0?0:l+1;
        }
        int mid=l+r>>1;
        int res=0;
        if(p>mid)res=max(res,queryr(x<<1|1,mid+1,r,p,v));
        if(res==0)res=max(res,queryr(x<<1,l,mid,p,v));
        return res;
    }

    void build(int x,int l,int r){
        if(l==r)return t[x]=a[l],void ();
        int mid=l+r>>1;
        build(x<<1,l,mid);
        build(x<<1|1,mid+1,r);
        pushup(x);
    }
}using namespace SGT;

signed main() {
    // freopen(".in","r",stdin);
    // freopen(".out","w",stdout);


    int n=rd;
    for(int i=1;i<=n;i++){
        a[i]=rd;
    }


    build(1,1,n);

    int q=rd;
    while(q--){
        int op=rd;
        if(op==1){
            int l=rd,r=rd,x=rd;
            int L=queryl(1,1,n,l,x);
            int R=queryr(1,1,n,r,x);
            // cdbg(L,R);
            if(L>=R-2)puts("YES");
            else puts("NO");
        }else{
            int x=rd,v=rd;
            change(1,1,n,x,v);
        }
    }


}