#include <stdio.h>

#define VELA 1000000001

int main()
{
    int n;
    int m[100000][2];
    int c;
    int cas;
    int fh;
    int splnene;
    char preif;

    int i,j,k,l;

    int ctrl;
    while(1)
    {
        ctrl=scanf("%d\n", &n);
        if(ctrl==EOF) {break;}

        for(i=0; i<=n-1; i++)
        {
            scanf("%d %d\n", &m[i][0], &m[i][1]);
        }
        scanf("%d\n", &c);

        for(i=0; i<=c-1; i++)
        {
            preif=getchar();
            if(preif=='g')
            {
                getchar(); getchar(); getchar();
                preif=getchar();
                //-------------------------------------gt min
                if(preif=='i')
                {
                    preif=getchar(); preif=getchar();
                    scanf("%d", &cas);

                    k=0;
                    splnene=0;
                    for(j=0; j<=n-1; j++)
                    {
                        while(1)
                        {
                            if(m[k][0] >= m[j][0]-cas) {break;}
                            else {k++;}
                        }
                        fh=VELA;
                        for(l=k; l<=j-1; l++)
                        {
                            if(m[l][1]<fh) {fh=m[l][1];}
                        }
                        if(fh==VELA) {fh=VELA;}
                        if(m[j][1]>fh) {splnene++;}
                    }
                    printf("%d\n", splnene);
                }
                //-------------------------------------koniec gt min
                //-------------------------------------gt max
                if(preif=='a')
                {
                    getchar(); getchar();
                    scanf("%d\n", &cas);

                    k=0;
                    splnene=0;
                    for(j=0; j<=n-1; j++)
                    {
                        while(1)
                        {
                            if(m[k][0] >= m[j][0]-cas) {break;}
                            else {k++;}
                        }
                        fh=0;
                        for(l=k; l<=j-1; l++)
                        {
                            if(m[l][1]>fh) {fh=m[l][1];}
                        }
                        if(fh==0) {fh=VELA;}
                        if(m[j][1]>fh) {splnene++;}
                    }
                    printf("%d\n", splnene);
                }
                //-------------------------------------koniec gt max
                //-------------------------------------gt avg
                if(preif=='v')
                {
                    preif=getchar(); preif=getchar();
                    scanf("%d", &cas);

                    k=0;
                    splnene=0;
                    for(j=0; j<=n-1; j++)
                    {
                        while(1)
                        {
                            if(m[k][0] >= m[j][0]-cas) {break;}
                            else {k++;}
                        }
                        fh=0;
                        for(l=k; l<=j-1; l++)
                        {
                            {fh+=m[l][1];}  //je tam j-k scitancov
                        }
                        if(fh==0) {fh=VELA;}
                        if(m[j][1]*(j-k) > fh) {splnene++;}
                    }
                    printf("%d\n", splnene);
                }
                //-------------------------------------koniec gt avg
            }
            if(preif=='l')
            {
                getchar(); getchar(); getchar();
                preif=getchar();
                //-------------------------------------lt min
                if(preif=='i')
                {
                    preif=getchar(); preif=getchar();
                    scanf("%d", &cas);

                    k=0;
                    splnene=0;
                    for(j=0; j<=n-1; j++)
                    {
                        while(1)
                        {
                            if(m[k][0] >= m[j][0]-cas) {break;}
                            else {k++;}
                        }
                        fh=VELA;
                        for(l=k; l<=j-1; l++)
                        {
                            if(m[l][1]<fh) {fh=m[l][1];}
                        }
                        if(fh==VELA) {fh=0;}
                        if(m[j][1]<fh) {splnene++;}
                    }
                    printf("%d\n", splnene);
                }
                //-------------------------------------koniec lt min
                //-------------------------------------lt max
                if(preif=='a')
                {
                    getchar(); getchar();
                    scanf("%d\n", &cas);

                    k=0;
                    splnene=0;
                    for(j=0; j<=n-1; j++)
                    {
                        while(1)
                        {
                            if(m[k][0] >= m[j][0]-cas) {break;}
                            else {k++;}
                        }
                        fh=0;
                        for(l=k; l<=j-1; l++)
                        {
                            if(m[l][1]>fh) {fh=m[l][1];}
                        }
                        if(fh==0) {fh=0;}
                        if(m[j][1]<fh) {splnene++;}
                    }
                    printf("%d\n", splnene);
                }
                //-------------------------------------koniec lt max
                //-------------------------------------lt avg
                if(preif=='v')
                {
                    preif=getchar(); preif=getchar();
                    scanf("%d", &cas);

                    k=0;
                    splnene=0;
                    for(j=0; j<=n-1; j++)
                    {
                        while(1)
                        {
                            if(m[k][0] >= m[j][0]-cas) {break;}
                            else {k++;}
                        }
                        fh=0;
                        for(l=k; l<=j-1; l++)
                        {
                            {fh+=m[l][1];}  //je tam j-k scitancov
                        }
                        if(fh==0) {fh=0;}
                        if(m[j][1]*(j-k) < fh) {splnene++;}
                    }
                    printf("%d\n", splnene);
                }
                //-------------------------------------koniec lt avg
            }
        }
    }
    return 0;
}