//qoj4359
#include <bits/stdc++.h>
using namespace std;

const int N = 1e5 + 10;
typedef long long ll;
int n, b[N], la[N][5], nx[N][5];
ll a[N], ans = 1e18;
char s[5];

void dfs(int x, int id, ll ed, ll now){
    if(x == 0 || x == n + 1){
        return;
    }
    if(id == 5){
        // printf("---- %d %lld\n", id, now);
        ans = min(ans, now + abs(a[x] - ed));
    } else {
        dfs(la[x][id], id+1, ed, now + abs(a[x] - a[la[x][id]]));
        dfs(nx[x][id], id+1, ed, now + abs(a[x] - a[nx[x][id]]));
    }
}

ll cal(int x, ll t){
    if(x == 0){
        return 1e18;
    }
    ans = 1e18;
    dfs(x, 1, t, 0);
    // printf("%d %lld %lld\n", x, t, ans);
    return ans;
}

int main(){
    scanf("%d", &n);
    for(int i = 1; i <= n; ++ i){
        scanf("%lld%s", &a[i], s);
        if(s[0] == 'J'){
            b[i] = 1;
        } else if(s[0] == 'O'){
            b[i] = 2;
        } else if(s[0] == 'I'){
            b[i] = 3;
        } else if(s[0] == 'G'){
            b[i] = 4;
        }
        // printf("%d\n", b[i]);
    }
    for(int i = 1; i <= n; ++ i){
        for(int j = 1; j <= 4; ++ j){
            la[i][j] = la[i-1][j];
        }
        la[i][b[i]] = i;
    }
    for(int j = 1; j <= 4; ++ j){
        nx[n+1][j] = n+1;
    }
    for(int i = n; i >= 1; -- i){
        for(int j = 1; j <= 4; ++ j){
            nx[i][j] = nx[i+1][j];
        }
        nx[i][b[i]] = i;
    }
    int q;
    scanf("%d", &q);
    while(q--){
        ll s, t;
        scanf("%lld%lld", &s, &t);
        int x = lower_bound(a + 1, a + n + 1, s) - a;
        ll ans = 1e18;
        ans = min(ans, abs(a[x] - s) + cal(x, t));
        ans = min(ans, abs(a[x-1] - s) + cal(x-1, t));
        printf("%lld\n", ans);
    }
    return 0;
}