#include <cstdlib>
#include <cstdio>
#include <iostream>
#include <cstdlib>
#include <cmath>
#include <string>
#include <climits>
using namespace std;

int mymin(int ** samples, int time, int index, int * minIndex) {
    int begtime = samples[index][0];
    int min = INT_MAX;
    *minIndex = index-1;
    for ( int i = 1; index-i > 0 && samples[index-i][0] > begtime-time; i++){
        if (samples[index-i][1] < min){
            min = samples[index-i][1];
            *minIndex = index-i;
        }
    }
    return min;
}

int mymax(int ** samples, int time, int index, int * maxIndex) {
    int begtime = samples[index][0];
    int max = 0;
    for ( int i = 1; index-i > 0 && samples[index-i][0] > begtime-time ;i++){
        if (samples[index-i][1] < max) {
            max = samples[index-i][1];
            *maxIndex = index-i;
        }
    }
    return max;
}

double myavg(int ** samples, int time, int index) {
    int begtime = samples[index][0];
    double sum = 0;
    int cnt = 0;
    for ( int i = 1; index-i > 0 && samples[index-i][0] > begtime-time ;i++){
        sum += samples[index-i][1];
        cnt++;
    }
    return cnt > 0 ? (sum/cnt) : -1;
}

int solve(string oper, string fun, int time, int ** samples, int lenght) {
    int cnt = 0;
    if (oper == "lt"){
        if (fun == "min"){
            for ( int i = lenght - 1 ; i >= 0; i--){
                int minIndex; 
                int minTmp = mymin(samples, time, i, &minIndex);
                if (samples[i][1]<minTmp)cnt++;
                i = minIndex;
            }
        }
        else if (fun == "max"){
            for ( int i = lenght - 1 ; i >= 0; i--){
                int minIndex; 
                int minTmp = mymax(samples, time, i, &minIndex);
                if (samples[i][1]<minTmp)cnt++;
                cnt += minIndex - i;
                i = minIndex;
            }
        }
        else {
            for ( int i = lenght - 1; i >=0; i--){
                double avgtemp = myavg(samples, time, i);
                if (avgtemp != -1 && samples[i][1] < avgtemp) cnt++;
            }
        }
    }
    else {
        if (fun == "min"){
            for ( int i = lenght - 1 ; i >= 0; i--){
                int minIndex; 
                int minTmp = mymin(samples, time, i, &minIndex);
                if (samples[i][1]>minTmp)cnt++;
                cnt += minIndex - i;
                i = minIndex;
            }
        }
        else if (fun == "max"){
            for ( int i = lenght - 1 ; i >= 0; i--){
                int minIndex; 
                int minTmp = mymax(samples, time, i, &minIndex);
                if (samples[i][1]>minTmp)cnt++;
                i = minIndex;
            }
        }
        else {
            for ( int i = lenght - 1; i >=0; i--){
                double avgtemp = myavg(samples, time, i);
                //cout<<avgtemp<<endl;
                if (avgtemp != -1 &&  samples[i][1] > avgtemp) cnt++;
            }
        }
    }
    return cnt;
}

int main(int argc, char** argv) {
    int** samples;
    int n;
    
    while (cin>>n) {
        
        samples = new int*[n];
        for (int i = 0; i < n; i++) {
            samples[i] = new int[2];
            cin >> samples[i][0] >> samples[i][1];
        }
        //for (int i = 0; i < n; i++) cout << samples[i][0] << "\t" << samples[i][1] << endl;
        int nOfE;
        string oper;
        string fun;
        int time;
        cin>>nOfE;

        for (int i = 0; i < nOfE; i++) {
            cin >> oper >> fun>>time;
            cout<<oper<<"\t"<<fun<<"\t"<<time<<endl;
            cout << solve(oper, fun, time, samples, n)<<endl;
        }
    }
    return 0;
}