#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#define ll long long
#define ls p<<1
#define rs p<<1|1
using namespace std;
const int MN=5e5+5;
ll n,q,a[MN],op,l,r,k,ans;
struct tree{ll l,r,num;}t[MN<<2];
void write(ll n){if(n<0){putchar('-');write(-n);return;}if(n>9)write(n/10);putchar(n%10+'0');}
ll read(){ll x=0,f=1;char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}return x*f;}
ll gcd(ll a, ll b){return b?gcd(b,a%b):a;}
void build(ll p, ll l, ll r){
    t[p].l=l;t[p].r=r;
    if(l==r){
        t[p].num=a[l];
        return;
    }
    ll mid=l+r>>1;
    build(ls,l,mid);build(rs,mid+1,r);
    t[p].num=gcd(t[ls].num,t[rs].num);
}
void change(ll p, ll x, ll v){
    if(t[p].l==t[p].r){
        t[p].num=v;
        return;
    }
    ll mid=t[p].l+t[p].r>>1;
    if(x<=mid) change(ls,x,v);
    else change(rs,x,v);
    t[p].num=gcd(t[ls].num,t[rs].num);
}
void query(ll p, ll l, ll r, ll x){
    if(ans>1) return;
    if(t[p].num%x==0&&l<=t[p].l&&t[p].r<=r) return;
    if(t[p].l==t[p].r){if(l<=t[p].l&&t[p].r<=r) ans++;return;}
    ll mid=t[p].l+t[p].r>>1;
    if(l<=mid&&t[ls].num%x) query(ls,l,r,x);
    if(r>mid&&t[rs].num%x) query(rs,l,r,x);
}
int main(){
    n=read();
    for(int i=1; i<=n; i++) a[i]=read();
    build(1,1,n);
    q=read();while(q--){
        op=read();
        if(op==1){
            l=read();r=read();k=read();ans=0;query(1,l,r,k);
            if(ans==0||ans==1) printf("YES\n");
            else printf("NO\n");
        }
        else{
            l=read();k=read();
            change(1,l,k);
        }
    }
    return 0;
}