#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(int)n; i++)
#define repi(i,m,n) for(int i=(int)m; i<=(int)n; i++)
#define rrep(i,n) for(int i=(int)n-1; i>=0; i--)
#define rrepi(i,m,n) for(int i=(int)n; i>=(int)m; i--)
#define all(x) x.begin(),x.end()
template <typename T> inline bool chmin(T& a, const T& b) { return a > b ? a = b, true : false; };
template <typename T> inline bool chmax(T& a, const T& b) { return a < b ? a = b, true : false; };
template <typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}
using ll = long long;

#include <atcoder/lazysegtree>
using namespace atcoder;
using S = long long;
using F = long long;

constexpr S INF = 8e18;

S op(S a, S b){ return std::max(a, b); }
S e(){ return 0;}
S fx(F f, S x){ return f+x; }
F fg(F f, F g){ return f+g; }
F id(){ return 0; }

int main(){
    int n; cin >> n;
    map<string,set<int>> dict;
    vector<int> l(n),r(n),time;
    rep(i,n){
        string x; 
        cin >> x >> l[i] >> r[i];
        time.emplace_back(l[i]);
        time.emplace_back(r[i]);
        dict[x].emplace(l[i]);
        dict[x].emplace(r[i]);
    }
    int q; cin >> q;
    vector<int> c(q),t(q,0),ql(q,0),qr(q,0);
    vector<string> x(q);
    rep(i,q){
        cin >> c[i];
        if(c[i] == 1){
            cin >> x[i] >> t[i];
            time.emplace_back(t[i]);
        }
        else if(c[i] == 2){
            cin >> t[i];
            time.emplace_back(t[i]);
        }
        else{
            cin >> x[i] >> ql[i] >> qr[i];
            time.emplace_back(ql[i]);
            time.emplace_back(qr[i]);
        }
    }
    
    uniq(time);
    lazy_segtree<S, op, e, F, fx, fg, id> seg((int)time.size());
    unordered_map<int,int> idx;
    rep(i,time.size()) idx[time[i]] = i;

    rep(i,n) seg.apply(idx[l[i]], idx[r[i]]+1, 1);
    rep(i,q){
        if(c[i] == 1){
            auto &v = dict[x[i]];
            auto it = lower_bound(all(v),t[i]);
            if(distance(v.begin(),it)%2 == 1 || *it == t[i]) cout << "Yes\n";
            else cout << "No\n";
        }
        else if(c[i] == 2){
            cout << seg.get(idx[t[i]]) << "\n";
        }
        else{
            seg.apply(idx[ql[i]], idx[qr[i]]+1, 1);
        }
    }

    
    return 0;
}