#include<bits/stdc++.h>
#include <ext/pb_ds/priority_queue.hpp>
using namespace std;
#ifdef local
template <typename T>
string to_string(vector<T> v) {
    bool first = true;
    string res = "{";
    for (int i = 0; i < static_cast<int>(v.size()); i++) {
        if (!first) {
            res += ", ";
        }
        first = false;
        res += to_string(v[i]);
    }
    res += "}";
    return res;
}
template <typename T>
string to_string(vector<vector<T>> v){
    bool first = true;
    string res = "{\n";
    for(auto I:v)res+= to_string(I)+"\n";
    res += "}";
    return res;
}
void debug_out() { cerr << endl; }
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << " " << to_string(H);
    debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
typedef long long ll;
#define f(i, l, r) for(int i=l;i<=r;i++)
#define rf(i, r, l) for(int i=r;i>=l;--i)
#define all(x) x.begin(),x.end()
const int N = 3e5+10;
const int mod = 998244353;
ll power(ll a, ll b) {ll res = 1;while (b) {if (b & 1)res = res * a % mod;a = a * a % mod;b >>= 1;}return res;}



int main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#ifdef local
    freopen("../in.txt", "r", stdin);
#endif
    int n;cin>>n;
    vector<string> t(n+1);
    vector<int> S0(1<<25),S1(1<<25),pos(1<<25);
    pos[0]=1;S0[0]=1;S1.back()=1;
    for(int i=1;i<=n;i++){
        cin>>t[i];
        int S=0;
        for(auto I:t[i]){
            if(I<'z')S|=1<<(I-'a');
            S1[S]++;
            S0[((1<<25)-1)^S]++;
            pos[S]=i;
        }
    }
    for(int i=0;i<25;i++)
        for(int s=0;s<1<<25;s++)
            if(s&(1<<i))
                S1[s]+=S1[s^(1<<i)],
                S0[s]+=S0[s^(1<<i)];
    int q;cin>>q;
    while(q--){
        string b,c;
        for(int i=0;i<5;i++)cin>>c,b+=c;
        vector<int> a(25),p2;
        int g=0;
        for(int i=0;i<25;i++) {
            if (b[i] <= 'Z')a[i] = 2,p2.push_back(i);
            else if (b[i] == 'r')a[i] = 1,g++;
        }
        auto count=[&](){
          int c0=0,c1=0,s0=0,s1=0,s2=0;
          for(int i=0;i<25;i++){
              if(a[i]==0)c0++,s0|=(1<<i);
              else if(a[i]==1)c1++,s1|=(1<<i);
              else s2|=(1<<i);
          }
          int ans=0;
          if(c1<=c0){
              for(int s=s1;;s=(s-1)&s1){
                  int k=__builtin_popcount(s);
                  int f=((c1-k)&1)?-1:1;
                  ans+=f*S1[s|s2];
                  if(!s)break;
              }
          }else{
              for(int s=s0;;s=(s-1)&s0){
                  int k= __builtin_popcount(s);
                  int f=((c0-k)&1)?-1:1;
                  ans+=f*S0[s|s2];
                  if(!s)break;
              }
          }
          return ans;
        };
        while(p2.size()>9){
            a[p2.back()]=0;
            if(!count())a[p2.back()]=1;
            p2.pop_back();
        }
        int s2=0,s1=0,res=-1;
        for(int i=0;i<25;i++){
            if(a[i]==2)s2|=(1<<i);
            if(a[i]==1)s1|=(1<<i);
        }
        for(int s=s2;;s=(s-1)&s2){
            if(pos[s|s1])res=pos[s|s1];
            if(!s)break;
        }
        if(res==-1)cout<<"IMPOSSIBLE\n";
        else cout << t[res] << " " << g << "\n";
    }
}