import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(1000005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = -1-(-1 << 63)
# md = 10**9+7
md = 998244353

class BitSum:
    def __init__(self, n):
        self._n = n+1
        self._table = [0]*self._n
        self._origin = [0]*n

    def __getitem__(self, item):
        return self._origin[item]

    def add(self, i, x):
        self._origin[i] += x
        i += 1
        while i < self._n:
            self._table[i] += x
            i += i & -i

    def sum(self, i):
        i += 1
        res = 0
        while i > 0:
            res += self._table[i]
            i -= i & -i
        return res

    def sumlr(self, l, r):
        if l >= r: return 0
        if l == 0: return self.sum(r-1)
        return self.sum(r-1)-self.sum(l-1)

    # return "min(i) of sum(i)>=x" or "N"
    def bisect(self, x):
        idx = 0
        d = 1 << (self._n-1).bit_length()-1
        while d:
            if idx+d < self._n and self._table[idx+d] < x:
                x -= self._table[idx+d]
                idx |= d
            d >>= 1
        return idx

from bisect import *
from collections import defaultdict

n=II()
lr=defaultdict(list)
dec=set()
for _ in range(n):
    x,l,r=SI().split()
    l,r=int(l),int(r)
    lr[x].append((l,r+1))
    dec.add(l)
    dec.add(r+1)

q=II()
task=[]
for _ in range(q):
    qt,*xt=SI().split()
    qt=int(qt)
    if qt==1:
        dec.add(int(xt[1]))
    if qt==2:
        dec.add(int(xt[0]))
    if qt==3:
        x,l,r=xt
        dec.add(int(l))
        dec.add(int(r)+1)
    task.append((qt,xt))

enc={a:i for i,a in enumerate(sorted(dec))}
bit=BitSum(len(dec)+5)

for x in lr:
    for l,r in lr[x]:
        l=enc[l]
        r=enc[r]
        bit.add(l,1)
        bit.add(r,-1)
    lr[x].sort(key=lambda x:x[0])

for qt,xt in task:
    if qt==1:
        x,t=xt
        t=int(t)
        i=bisect(lr[x],(t,inf))
        if i and t<lr[x][i-1][1]:
            print("Yes")
        else:
            print("No")
    elif qt==2:
        t=int(xt[0])
        t=enc[t]
        print(bit.sum(t))
    else:
        x,l,r=xt
        l,r=int(l),int(r)+1
        insort(lr[x],(l,r))
        l,r=enc[l],enc[r]
        bit.add(l,1)
        bit.add(r,-1)