#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using P = pair<int, int>;
const double eps = 1e-8;
const ll MOD = 1000000007;
const int INF = INT_MAX / 2;
const ll LINF = LLONG_MAX / 2;
template <typename T1, typename T2>
bool chmax(T1 &a, const T2 &b) {
  if(a < b) {a = b; return true;}
  return false;
}
template <typename T1, typename T2>
bool chmin(T1 &a, const T2 &b) {
  if(a > b) {a = b; return true;}
  return false;
}
template<typename T1, typename T2>
ostream& operator<<(ostream &os, const pair<T1, T2> p) {
  os << p.first << ":" << p.second;
  return os;
}
template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  for(int i=0;i<((int)(v.size()));++i) {
    if(i) os << " ";
    os << v[i];
  }
  return os;
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  while(1) {
    int n;
    cin >> n;
    if (n == 0) break;
    vector<pair<string, string>> v(n);
    for(int i=0;i<(n);++i) {
      string s;
      cin >> s;
      int pos = 0;
      for(int j=0;j<((int)(s.size()));++j) {
        if (s[j] == '-') {
          pos = j;
          break;
        }
      }
      v[i].first = s.substr(0, pos);
      v[i].second = s.substr(pos + 1, (int)(s.size()) - pos - 1);
    }
    map<string, int> mp;
    int id = 0;
    for(int i=0;i<(n);++i) {
      if (mp.find(v[i].first) == mp.end()) {
        mp[v[i].first] = id;
        id++;
      }
      if (mp.find(v[i].second) == mp.end()) {
        mp[v[i].second] = id;
        id++;
      }
    }
    vector<P> cross(n);
    for(int i=0;i<(n);++i) {
      cross[i].first = mp[v[i].first];
      cross[i].second = mp[v[i].second];
    }
    vvi g1(id);
    for(int i=0;i<(n);++i) {
      g1[cross[i].first].push_back(cross[i].second);
    }
    map<P, bool> sel1, sel2;
    for(int i=0;i<(n);++i) {
      for(int j=(i + 1);j<(n);++j) {
        if (cross[i].first == cross[j].first) {
          sel1[{cross[i].second, cross[j].second}] = true;
          sel1[{cross[j].second, cross[i].second}] = true;
        }
        if (cross[i].second == cross[j].second) {
          sel1[{cross[i].first, cross[j].first}] = true;
          sel1[{cross[j].first, cross[i].first}] = true;
        }
        if (cross[i].first == cross[j].second && cross[i].second != cross[j].first) {
          sel2[{cross[i].second, cross[j].first}] = true;
          sel2[{cross[j].first, cross[i].second}] = true;
        }
        if (cross[i].second == cross[j].first && cross[i].first != cross[j].second) {
          sel2[{cross[i].first, cross[j].second}] = true;
          sel2[{cross[j].second, cross[i].first}] = true;
        }
      }
    }
    for(int i=0;i<(n);++i) {
      sel2[{cross[i].first, cross[i].second}] = true;
      sel2[{cross[i].second, cross[i].first}] = true;
    }
    vvi g2(id);
    for(int i=0;i<(id);++i) {
      for(int j=0;j<(id);++j) {
        if (sel1[{i, j}] && !sel2[{i, j}]) {
          g2[i].push_back(j);
        }
      }
    }
    cout << id << endl;
    int m;
    cin >> m;
    for(int i=0;i<(m);++i) {
      string s;
      cin >> s;
      int pos = 0;
      for(int j=0;j<((int)(s.size()));++j) {
        if (s[j] == '-') {
          pos = j;
          break;
        }
      }
      string x = s.substr(0, pos);
      string y = s.substr(pos + 1, (int)(s.size()) - pos - 1);
      if (mp.find(x) == mp.end() || mp.find(y) == mp.end()) {
        cout << "NO" << endl;
        continue;
      }
      int idx = mp[x];
      int idy = mp[y];
      queue<P> que;
      vvi d(2, vi(id, INF));
      d[0][idx] = 0;
      que.push({0, idx});
      while (!que.empty()) {
        int col, now;
        tie(col, now) = que.front();
        que.pop();
        for (auto &nxt: g1[now]) {
          if (d[!col][nxt] > d[col][now] + 1) {
            d[!col][nxt] = d[col][now] + 1;
            que.push({!col, nxt});
          }
        }
        for (auto &nxt: g2[now]) {
          if (d[col][nxt] > d[col][now] + 1) {
            d[col][nxt] = d[col][now] + 1;
            que.push({col, nxt});
          }
        }
      }
      if (d[1][idy] != INF) {
        cout << "YES" << endl;
      } else {
        cout << "NO" << endl;
      }
    }
  }
}



Measured memory_bytes: 6328