#include <bits/stdc++.h>
#define REP(i,n) for(int i=0, i##_len=(n); i<i##_len; ++i)
//#include <atcoder/all>
#define endl "\n"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template<class T>
inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}

const long long INF = 1e18;
//const ll mod = 1000000007;
int L;
int Q;
int N; 
ll dpA[1<<25];
ll dpB[1<<25];
ll val[1<<25];
string S[100000];
int query[1<<25];
 
namespace REC1 {
ll calc(string X) {
    ll ret = 0;
    int sup = 0, fix = 0;
    REP (i, X.size()) {
	if (X[i] == '1') sup |= 1<<i;
	else if (X[i] == '?') fix |= 1<<i;
    }
    for (int sub=sup; ; sub=sup&(sub-1)) {
	if (__builtin_popcount(sup ^ sub) & 1) {
	    ret -= dpA[fix | sub];
	} else {
	    ret += dpA[fix | sub];
	}
	if (sub == 0) break;
    }
    return ret;
}
};
 
namespace REC0 {
ll calc(string X) {
    ll ret = 0;
    int sup = 0, fix = 0;
    REP (i, X.size()) {
	if (X[i] == '0') sup |= 1<<i;
	else if (X[i] == '1') fix |= 1<<i;
    }
    for (int sub=sup; ; sub=sup&(sub-1)) {
	if (__builtin_popcount(sub) & 1) {
	    ret -= dpB[fix | sub];
	} else {
	    ret += dpB[fix | sub];
	}
	if (sub == 0) break;
    }
    return ret;
}
};
 
namespace RECQ {
ll calc(string X) {
    ll ret = 0;
    int sup = 0, fix = 0;
    REP (i, X.size()) {
	if (X[i] == '?') sup |= 1<<i;
	else if (X[i] == '1') fix |= 1<<i;
    }
    for (int sub=sup; ; sub=sup&(sub-1)) {
	ret += val[fix | sub];
	if (sub == 0) break;
    }
    return ret;
}
};

ll calc(string X) {
	int zero = count(X.begin(), X.end(), '0');
	int one = count(X.begin(), X.end(), '1');
	ll ans;
	if (zero <= 8) {
	    ans = REC0::calc(X);
	} else if (one <= 8) {
	    ans = REC1::calc(X);
	} else {
	    ans = RECQ::calc(X);
	}
    return ans;
}

string T;

void solve() {
    T.clear();
    for(int i = 0; i < 5; i++) {
        string A;
        cin >> A;
        T += A;
    }
    string X = string(L, '?');
    int onenum = 0;
    for(int i = 0; i < L; i++) {
        if(T[i] == 'r') {
            onenum++;
            X[i] = '1';
        }
        if(T[i] == 'b' or T[i] == 'n' or T[i] == 'x') {
            X[i] = '0';
        }
    }
    if(calc(X) == 0) {
        cout << "IMPOSSIBLE" << endl;
        return;
    }
    for(int i = 0; i < L; i++) {
        if(X[i] != '?') continue;
        X[i] = '0';
        if(calc(X) == 0) {
            X[i] = '1';
        }
    }
    int bits = 0;
    for(int i = 0; i < L; i++) {
        if(X[i] == '1') bits |= (1 << i);
    }
    cout << S[query[bits]] << " " << onenum << endl;
}
 
void MAIN() {
    L = 25;
    for(int i = 0; i < (1 << L); i++) {
        val[i] = 0;
        query[i] = -1;
    }
    cin >> N;
    for(int i = 0; i < N; i++) {
        int bits = 0;
        cin >> S[i];
        for(auto c : S[i]) {
            if(c == 'z') continue;
            int j = (int)(c - 'a');
            bits |= (1 << j);
            if(query[bits] != -1) continue;
            val[bits] = 1;
            query[bits] = i;
        }
    }
 
    REP (s, 1<<L) {
	dpA[s] = dpB[s] = val[s];
    }
 
    REP (t, L) REP (s, 1<<L) if (~s>>t&1) {
	dpA[s|(1<<t)] += dpA[s];
	dpB[s] += dpB[s|(1<<t)];
    }
    int Q;
    cin >> Q;
    for(int q = 0; q < Q; q++) solve();
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    MAIN();
    return 0;
}