import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
class MapEntry<K extends Comparable<K>,E> implements Comparable<K> {
    // Each MapEntry object is a pair consisting of a key (a Comparable
    // object) and a value (an arbitrary object).
    K key;
    E value;
    public MapEntry (K key, E val) {
        this.key = key;
        this.value = val;
    }

    public int compareTo (K that) {
    // Compare this map entry to that map entry.
        @SuppressWarnings("unchecked")
  MapEntry<K,E> other = (MapEntry<K,E>) that;
        return this.key.compareTo(other.key);
    }
    public String toString () {
        return "<" + key + "," + value + ">";
    }
}
class SLLNode<E> {
 protected E element;
 protected SLLNode<E> succ;
 public SLLNode(E elem, SLLNode<E> succ) {
  this.element = elem;
  this.succ = succ;
 }
 @Override
 public String toString() {
  return element.toString();
 }
}
class CBHT<K extends Comparable<K>, E> {
 // An object of class CBHT is a closed-bucket hash table, containing
 // entries of class MapEntry.
 private SLLNode<MapEntry<K,E>>[] buckets;
 @SuppressWarnings("unchecked")
 public CBHT(int m) {
  // Construct an empty CBHT with m buckets.
  buckets = (SLLNode<MapEntry<K,E>>[]) new SLLNode[m];
 }
 private int hash(K key) {
  // Translate key to an index of the array buckets.
  return Math.abs(key.hashCode()) % buckets.length;
 }
 public SLLNode<MapEntry<K,E>> search(K targetKey) {
  // Find which if any node of this CBHT contains an entry whose key is
  // equal
  // to targetKey. Return a link to that node (or null if there is none).
  int b = hash(targetKey);
  for (SLLNode<MapEntry<K,E>> curr = buckets[b]; curr != null; curr = curr.succ) {
   if (targetKey.equals(((MapEntry<K, E>) curr.element).key))
    return curr;
  }
  return null;
 }
 public void insert(K key, E val) {  // Insert the entry <key, val> into this CBHT.
  MapEntry<K, E> newEntry = new MapEntry<K, E>(key, val);
  int b = hash(key);
  for (SLLNode<MapEntry<K,E>> curr = buckets[b]; curr != null; curr = curr.succ) {
   if (key.equals(((MapEntry<K, E>) curr.element).key)) {
    // Make newEntry replace the existing entry ...
    curr.element = newEntry;
    return;
   }
  }
  // Insert newEntry at the front of the 1WLL in bucket b ...
  buckets[b] = new SLLNode<MapEntry<K,E>>(newEntry, buckets[b]);
 }
 public void delete(K key) {
  // Delete the entry (if any) whose key is equal to key from this CBHT.
  int b = hash(key);
  for (SLLNode<MapEntry<K,E>> pred = null, curr = buckets[b]; curr != null; pred = curr, curr = curr.succ) {
   if (key.equals(((MapEntry<K,E>) curr.element).key)) {
    if (pred == null)
     buckets[b] = curr.succ;
    else
     pred.succ = curr.succ;
    return;
   }
  }
 }
 public String toString() {
  String temp = "";
  for (int i = 0; i < buckets.length; i++) {
   temp += i + ":";
   for (SLLNode<MapEntry<K,E>> curr = buckets[i]; curr != null; curr = curr.succ) {
    temp += curr.element.toString() + " ";
   }
   temp += "\n";
  }
  return temp;
 }
}
/////////////////////////////////////////////
public class RoutingHashJava {



  public static void main (String[] args) throws IOException {

   CBHT<String,String[]> tabela;
   BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
   int N = Integer.parseInt(br.readLine());


   tabela=new CBHT<String,String[]>(2*N);  //za 0.5 load factor

          for(int i=1;i<=N;i++){

          String interfejs=br.readLine(); //adresa na interfejs
          String mrezhi=br.readLine(); //adresi na mrezhi do koi ruterot ima statici ruti
          String[] nizaMrezhi = mrezhi.split(",");
          tabela.insert(interfejs, nizaMrezhi);

           }


       N = Integer.parseInt(br.readLine());


    for (int i=1;i<=N;i++)    //ovoj ni e glaven for kade sto ke go izminuvame vlezot od oblik (interfejs/novred/mrezha)
         {
          String interfejs=br.readLine(); // ja citame adresata na interfejs
          String mreza=br.readLine();  // i ja citame adresata na mrezata
          String pom1 = mreza.substring(0,mreza.lastIndexOf(".")); // so ova od mrezata koja momentalno ja citame
                                                                   //go zimame delot do poslednata tocka
                                                                   //23.3.3.3 -->  23.3.3
                                                                   //ovoj string pom1 ke ni treba posle
                                                                   //koga ke ja sporeduvame ovaa mreza so nizataMrezhi
                                                                   //za soodvetniot interfejs
                                                                   //dokolku ovaa pom1 se sovpaga so nekoja mrezha
                                                                   //od soodvetnata nizataMrezhi ke vratime "postoi"
                                                                   // a ako gi izmineme site od nizataMrezhi i pom1 nema
                                                                   //da se sovpadne so nitu edna vrakame "ne postoi"


              SLLNode<MapEntry<String, String[]>> momentalen = tabela.search(interfejs); //barame dali vneseniot interfejs go ima vo
                                                                                         // tabelata koja e od oblik
                                                                                         //<interfejs,nizaMrezhi>
                                                                                         //<interfejs,nizaMrezhi>
                                                                                         //<interfejs,nizaMrezhi> ....


              if(momentalen == null) //ako ne go najdeme pecatime "ne postoi"
                    {

                        System.out.println("ne postoi");
                        continue; // ke se vrati vo for-ot za i+1
                    }

              else    //ako go najdeme soodvetniot interfejs, prodolzuvame da rabotime so negovata nizaMrezhi

                   {
                        String[] nizaMrezhi = momentalen.element.value; //nizataMrezhi za interfejsot koj momentalno go razgleduvame vo tabelata


                        boolean flag = false;
                        for(int k = 0; k<nizaMrezhi.length;k++){

                            String mrezha = nizaMrezhi[k];
                            String pom2=mrezha.substring(0,mrezha.lastIndexOf("."));  // od nizataMrezhi soodvetni za interfejsot gi izminuvame site so for
                            if(pom1.equals(pom2))                                     // se dodeka ne najdeme soodvetna ili dodeka ne
                            flag=true;                                                //gi izmineme site. Za da proveriem dali e soodvetna
                     }                                                                //vo pom2 zacuvuvame delot od adresata na mrezata do pslednata tocka
                                                                                      //primer: 23.3.3.3 -->  23.3.3
                                                                                      //i toj go sporeduvame so pom1 koj ni bese adresata na vleznata mrezha

                        if(flag) System.out.println("postoi");
                        else System.out.println("ne postoi");

                        }
         }
  }
}