#include <bits/stdc++.h>
using namespace std;
#define PB push_back
#define ZERO (1e-10)
#define INF (1<<29)
#define CL(A,I) (memset(A,I,sizeof(A)))
#define DEB printf("DEB!"\n);
#define D(X) cout << "  "<<#X<<": "<<X<<endl;
#define EQ(A,B) (A+ZERO>B&&A-ZERO<B)
typedef long long ll;
typedef long long LINT;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
#define IN(n) int n; scanf("%d", &(n));
#define FOR(i, m, n) for (int i(m); i<n; i++)
#define REP(i, n) FOR(i, 0, n)
#define F(n) REP(i, n)
#define FF(n) REP(j, n)
#define FT(m, n) FOR(k, m, n)
#define aa first
#define bb second
#define FI first
#define SE second
void ga(int N, int *A){F(N)scanf("%d",A+i);}

int n;

ll times[100007];
ll vals[100007];


bool process(){
    cin>>n;
    if(!cin) return false;
    
    REP(i,n) 
        cin>>times[i]>>vals[i];
    

    int qq;
    cin>>qq;
    REP(i,qq) {
        string f,agg;
        int lim;
        cin>>f>>agg>>lim;
    
        int ff = 0;
        if(f=="gt") ff=0;
        else ff=1;

        int af = 0;
        if(agg=="avg") af=0;
        else if(agg=="min") af=1;
        else af=2;        
        
        queue<int> q;
        multiset<ii> leset;
        
        ll lesum = 0;
        int cnt = 0;
        REP(j,n) {
            
            for(;q.size();){
                int node = q.front();
                if(times[node]+lim<times[j]){
                    q.pop();                    
                    lesum -= vals[node];
                    leset.erase({vals[node],times[node]});
                }
                else 
                    break;
            }
            
            if(q.size()) {

            if(af==0){
                if(ff==0 && lesum<vals[j]*q.size())
                    cnt++;
                else if(ff==1 && lesum>vals[j]*q.size())
                    cnt++;
            }
            else  {
                int val;
                if(af==1)
                val = leset.begin()->first;
                else val = leset.rbegin()->first;
                if(ff==0 && val<vals[j])
                    cnt++;
                else if(ff==1 && val>vals[j])
                    cnt++;
            }        

            }

            
            q.push(j);
            lesum += vals[j];
            leset.insert({vals[j],times[j]});
        }

        cout<<cnt<<endl;
    }




    return true;
}

int main() {
    while(process());
    return 0;
}