#include <bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
#define all(a) a.begin(),a.end()
typedef long long ll;
typedef pair<ll,int> P;
typedef vector<ll> vi;
constexpr ll inf=1ll<<61;
constexpr ll mod=998244353;
typedef modint998244353 mi;

int l[100005],r[100005];
string x[100005];
set<int>S2[100005];
vector<int>Q[100005];
map<string,int>M;
int cnt_x=0;

void idxadd(string s){
    if(M.find(s)==M.end()){
        M[s]=cnt_x;
        cnt_x++;
    }
}
map<int,int>compress(vector<int>&a){
    map<int,int>res;
    sort(all(a));
    a.erase(unique(all(a)),a.end());
    rep(i,a.size()){
        res[a[i]]=i;
    }
    return res;
}
struct S{
    long long value;
    int size;
};
using F = long long;

S op(S a, S b){ return {a.value+b.value, a.size+b.size}; }
S e(){ return {0, 0}; }
S mapping(F f, S x){ return {x.value + f*x.size, x.size}; }
F composition(F f, F g){ return f+g; }
F id(){ return 0; }

int main(){
    int n;cin>>n;
    vector<int>event;
    rep(i,n){
        cin>>x[i]>>l[i]>>r[i];
        idxadd(x[i]);
        event.push_back(l[i]);
        event.push_back(r[i]);
    }
    int q;cin>>q;
    rep(i,q){
        int query;cin>>query;
        Q[i].push_back(query);
        if(query==1){
            string x;cin>>x;
            int t;cin>>t;
            idxadd(x);
            event.push_back(t);
            Q[i].push_back(M[x]);
            Q[i].push_back(t);
        }
        if(query==2){
            int t;cin>>t;
            event.push_back(t);
            Q[i].push_back(t);
        }
        if(query==3){
            string x;cin>>x;
            int l,r;cin>>l>>r;
            idxadd(x);
            event.push_back(l);
            event.push_back(r);
            Q[i].push_back(M[x]);
            Q[i].push_back(l);
            Q[i].push_back(r);
        }
    }
    map<int,int>event2=compress(event);
    vector<S>v2(event.size(),{0,1});
    lazy_segtree<S,op,e,F,mapping,composition,id>fw(v2);
    rep(i,n){
        l[i]=event2[l[i]];
        r[i]=event2[r[i]];
        int id=M[x[i]];
        S2[id].insert(l[i]*2);
        S2[id].insert(r[i]*2+1);
        fw.apply(l[i],r[i]+1,1);
    }
    rep(i,q){
        if(Q[i][0]==1){
            int id=Q[i][1],t=event2[Q[i][2]];
            auto itr=S2[id].upper_bound(t*2);
            if(itr==S2[id].end())cout<<"No"<<endl;
            else{
                int t2=*itr;
                if(t2%2)cout<<"Yes"<<endl;
                else cout<<"No"<<endl;
            }
        }
        if(Q[i][0]==2){
            int t=event2[Q[i][1]];
            cout<<fw.get(t).value<<endl;
        }
        if(Q[i][0]==3){
            int id=Q[i][1],L=event2[Q[i][2]],R=event2[Q[i][3]];
            S2[id].insert(L*2);
            S2[id].insert(R*2+1);
            fw.apply(L,R+1,1);
        }
    }
}