#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef pair<ll,ll> pi;
typedef pair<ll,pi> ppi;
typedef pair<ll,ppi> pppi;
typedef pair<ll,pppi> ppppi;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) (UB(A,x)-LB(A,x))
#define sz(c) ((ll)(c).size())
/*
#include<boost/multiprecision/cpp_int.hpp>
namespace mp=boost::multiprecision;
using Bint=mp::cpp_int;
//*/
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}
//*
using mint=modint998244353;
const ll mod=998244353;
const ld EPS=1e-8;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint&a){os<<a.val();return os;}
//*/
pi op(pi a,pi b){return pi(a.F+b.F,a.S+b.S);}
pi e(){return pi(0,0);}
pi ma(ll f,pi x){return pi(f*x.S+x.F,x.S);}
ll co(ll f,ll g){return f+g;}
ll id(){return 0;}
int main(){
  ll N;cin>>N;vector<string>X(N);
  vector<pi>T(N);REP(i,N)cin>>X[i]>>T[i];
  ll Q;cin>>Q;
  vi q(Q),t(Q),l(Q),r(Q);vector<string>x(Q);
  REP(i,Q){
  	cin>>q[i];
  	if(q[i]==1)cin>>x[i]>>t[i];
  	else if(q[i]==2)cin>>t[i];
  	else{cin>>x[i]>>l[i]>>r[i];r[i]++;}
  }
  vector<string>mem=X;vi tim;
  for(auto i:x)mem.emplace_back(i);
  sort(ALL(mem));
  mem.erase(unique(ALL(mem)),mem.end());
  REP(i,N)tim.emplace_back(T[i].F);
  REP(i,N)tim.emplace_back(T[i].S+1);
  REP(i,Q)tim.emplace_back(l[i]);
  REP(i,Q)tim.emplace_back(r[i]);
  sort(ALL(tim));
  tim.erase(unique(ALL(tim)),tim.end());
  ll M=sz(mem);
  vector<set<pi>>K(M);
  REP(i,N){
  	T[i].S++;
  	T[i]=pi(LB(tim,T[i].F),LB(tim,T[i].S));
  	K[LB(mem,X[i])].insert(T[i]);
  }
  ll L=sz(tim);
  lazy_segtree<pi,op,e,ll,ma,co,id>S(L+1);
  REP(i,L+1)S.set(i,pi(0,1));
  REP(i,N)S.apply(T[i].F,T[i].S,1);
  REP(i,Q){
  	if(q[i]==1){
  		ll id=LB(mem,x[i]);
  		t[i]=UB(tim,t[i])-1;
  		auto it=K[id].lower_bound(pi(t[i]+1,-1e18));
  		if(it!=K[id].begin()&&(*(--it)).S>t[i])cout<<"Yes"<<endl;
  		else cout<<"No"<<endl;
  	}
  	else if(q[i]==2){
  		t[i]=UB(tim,t[i])-1;
  		cout<<S.get(t[i]).F<<endl;
  	}
  	else{
  		ll id=LB(mem,x[i]);
  		l[i]=UB(tim,l[i])-1;
  		r[i]=UB(tim,r[i])-1;
  		S.apply(l[i],r[i],1);
  		K[id].insert(pi(l[i],r[i]));
  	}
  }
  return 0;
}