#include<cstdio>

#include<iostream>

#define ll long long

#define R register int

#define pc(x) putchar(x)

#define ls (tr<<1)

#define rs (tr<<1|1)

const int M=;

using namespace std;

inline int g() {

    R ret=,fix=; register char ch; while(!isdigit(ch=getchar())) fix=ch=='-'?-:fix;

    do ret=ret*+(ch^); while(isdigit(ch=getchar())); return ret*fix;

}

int n,m,tot;

int sum[M<<];

inline int gcd(int a,int b) {return b?gcd(b,a%b):a;}

inline void build(int tr,int l,int r) {

    if(l==r) {sum[tr]=g(); return ;} R md=(l+r)>>;

    build(ls,l,md),build(rs,md+,r); sum[tr]=gcd(sum[ls],sum[rs]);

}

inline void update(int tr,int l,int r,int pos,int inc) {

    if(l==r) {sum[tr]=inc; return ;} R md=(l+r)>>;

    if(pos<=md) update(ls,l,md,pos,inc); else update(rs,md+,r,pos,inc);

    sum[tr]=gcd(sum[ls],sum[rs]);

}

inline void query(int tr,int l,int r,int LL,int RR,int mod) {

    if(tot>) return ; if(l==r) { ++tot; return ;} R md=(l+r)>>;

    if(LL<=md&&sum[ls]%mod) query(ls,l,md,LL,RR,mod); if(RR>md&&sum[rs]%mod) query(rs,md+,r,LL,RR,mod);

}

signed main() {

    n=g(); build(,,n); m=g();

    for(R i=;i<=m;++i) {

        R k=g(),l=g(),r=g(),mod;

        if(k&) {

            mod=g(),tot=,query(,,n,l,r,mod);

            tot>?(pc('N'),pc('O')):(pc('Y'),pc('E'),pc('S')); pc('\n');

        } else update(,,n,l,r);

    }

}