#include <iostream>
#include <set>
#include <math.h>

using namespace std;

#define ll int


int main()
{
    ll N;
    while(cin >> N)
    {
        ll t[N], s[N];
        for(ll i =0; i<N; i++)
        {
            cin >> t[i] >> s[i];
        }

        ll M;
        cin >> M;
        ll fn[M], agg[M], dt[M];
        for(ll i =0; i<M; i++)
        {
            char fns[3], aggs[4];
            scanf("%s %s", fns, aggs);

            fn[i] = (fns[0] == 'g');
            agg[i] = (aggs[0]=='m')?(aggs[1]=='i'?0:2):1;


            cin >> dt[i];
        }

        for(ll i =0; i<M; i++)
        {
            ll cnt = 0;
            if(agg[i] == 0) //min
            {
                multiset<ll> ss;
                ss.insert(s[0]);
                ll first = 0;
                for(ll j = 1; j < N; j++)
                {
                    ll cur_t = t[j];
                    while(t[first] < (cur_t - dt[i])) { ss.erase(ss.find(s[first])); first++; }
                    if(ss.size() > 0 && ((fn[i] == 0 && s[j] < *(ss.begin())) || (fn[i] == 1 && s[j] > *(ss.begin()))))
                    {
                        cnt++;
                    }
                    ss.insert(s[j]);
                }
            }

            if(agg[i] == 2) //max
            {
                multiset<ll, std::greater<ll> > ss;
                ss.insert(s[0]);
                ll first = 0;
                for(ll j = 1; j < N; j++)
                {
                    ll cur_t = t[j];
                    while(t[first] < (cur_t - dt[i])) { ss.erase(ss.find(s[first])); first++; }
                    if(ss.size() > 0 && ((fn[i] == 0 && s[j] < *(ss.begin())) || (fn[i] == 1 && s[j] > *(ss.begin()))))
                    {
                        cnt++;
                    }
                    ss.insert(s[j]);
                }
            }

            if(agg[i] == 1) //avg
            {
                ll sum = s[0];
                ll first = 0;
                for(ll j = 1; j < N; j++)
                {
                    ll cur_t = t[j];
                    while(t[first] < (cur_t - dt[i])) { sum -= s[first]; first++; }
                    if(sum > 0 && ((fn[i] == 0 && s[j]*(j-first) < sum) || (fn[i] == 1 && s[j]*(j-first) > sum)))
                    {
                        cnt++;
                    }
                    sum += s[j];
                }
            }

            cout << cnt << "\n";
        }

    }

    return 0;
}