#include <bits/stdc++.h>

using namespace std;

typedef long long int ll;
typedef long double ld;

typedef pair<ll, ll> ii;
typedef vector<ll> vi;
typedef vector<ii> vii;

#define PB push_back

#define FOR(prom,a,b) for( ll prom = (a); prom < (ll)(b); ++prom )
#define F(a) FOR(i,0,a)
#define FF(a) FOR(j,0,a)

#define EPS (1e-10)
#define INF ((1<<30)-1)

#define EQ(a,b) (fabs(a-b)/fabs(a+b) < EPS)

ll N,f,l;
string ch, type;
vi A,B;
set<ll> s;
ll sum,rng,res;

void add(ll v){
		if(type=="avg")sum+=v;
		else s.insert(v);
}
void remove(ll v){
		if(type=="avg")sum-=v;
		else s.erase(v);
}
ll val(){
		if(type=="avg")return sum;
		if(type=="min")return *s.begin();
		if(type=="max")return *s.rbegin();
}
ll c(){
		return (type=="avg"?(f-l)*B[f]:B[f]);
}
void check(){
		if(l==f)return;
		if(ch=="gt"){
				res+=c()>val();
		}else{
				res+=c()<val();
		}
}

int main ()
{
	ios::sync_with_stdio(false);

	while(cin>>N){
			A=B=vi(N);
			F(N){
					cin>>A[i]>>B[i];
			}
			ll M;cin>>M;
			F(M){
					s=set<ll>();
					sum=res=0;
					cin>> ch>>type>>rng;
					f=l=0;
					while(f<N){
							while(A[f]-A[l]>rng){
									remove(B[l]);
									l++;
							}
							check();
							add(B[f]);
							f++;
					}
					cout<<res<<endl;
			}
	}

	return 0;
}