#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<typename T>
using ordered_set = tree<T, null_type, std::less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using namespace std;
#define int long long
signed main(){
  int N,Q;
  cin>>N;
  map<string,set<pair<int,int>>> m;
  ordered_set<int> s,t;
  for(int i=0;i<N;i++){
  	string ss;
  	int a,b;
  	cin>>ss>>a>>b;
  	b++;
  	m[ss].insert({a,b});
  	s.insert(a);
  	t.insert(b);
  }
  cin>>Q;
  while(Q--){
  	int tt;
  	cin>>tt;
  	//cout<<tt<<endl;
  	if(tt == 3){
  		string ss;
  		int a,b;
  		cin>>ss>>a>>b;
  		b++;
  		m[ss].insert({a,b});
  		s.insert(a);
  		t.insert(b);
  	}
  	else if(tt == 1){
  		string ss;
  		int k;
  		cin>>ss>>k;
  		auto it = m[ss].lower_bound({k+1,-1});
  		if(m[ss].begin() == it) cout<<"No"<<endl;
  		else{
  			it--;
  			int a,b;
  			tie(a,b) = *it;
  			if(a <= k && k < b) cout<<"Yes"<<endl;
  			else cout<<"No"<<endl;
  		}
  	}
  	else{
  		int k;
  		cin>>k;
  		k++;
  		cout<<s.order_of_key(k)-t.order_of_key(k)<<endl;
  	}
  }
}