#include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <algorithm>
#include <math.h>
#include <string>
#include <climits>
#include <assert.h>
#include <iomanip>
#include <bitset>

#define FOR(i,a,b) for(int i= (a); i<((int)b); ++i)
#define FOE(i,a) for(auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v,x) (std::find(v.begin(), v.end(), x) != v.end())
#define IS_BIT_ON(bit, i) (bit & (1 << i))
#define BIT_ON(bit, i) (bit |= (1 << i))
#define BIT_OFF(bit, i) (bit &= ~(1 << i))
#define BIT_COUNT(bit) (__builtin_popcount(bit))

typedef long long LL;
template<typename T> std::vector<T> make_v(size_t a){return std::vector<T>(a);}
template<typename T,typename... Ts> auto make_v(size_t a, Ts... ts){ return std::vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));}    // C++14
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value==0>::type fill_v(T &t,const V &v){t=v;}
template<typename T,typename V> typename std::enable_if<std::is_class<T>::value!=0>::type fill_v(T &t,const V &v){for(auto &e:t) fill_v(e,v);}
template<class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
void print() { std::cout << std::endl; }
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) { std::cout << head; if (sizeof...(tail) != 0) {std::cout << " ";} print(std::forward<Tail>(tail)...); }
template <class T> void print(std::vector<T> &v) {for (auto& a : v) { std::cout << a; if (&a != &v.back()) {std::cout << " ";} }std::cout << std::endl;}
template <class T> void print(std::vector<std::vector<T>> &vv) { for (auto& v : vv) { print(v); }}
inline bool inside(long long y, long long x, long long H, long long W) {return 0 <= y and y < H and 0 <= x and x < W; }
template<class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) { return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)); }
template<class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) { return abs(x1 - x2) + abs(y1 - y2); }
template<typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }

template<class T> inline std::vector<T> unique(std::vector<T> v) {
    sort(v.begin(), v.end());
    v.erase(unique(v.begin(), v.end()), v.end());
    return v;
}
// 初項s, 交差dのn個の数列の和
long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
    return n * (2 * s + (n - 1) * d) / 2;
}

// 2のべき乗数かどうか
bool is_power_of_two(long long x) {
    return !(x & (x - 1));
}

// aとbの最大公約数 O(log min(a, b))
long long gcd(long long a, long long b) {
    if (b == 0) { return a; }
    return gcd(b, a % b);
}

// 数列vの最大公約数 O(N log d)
long long gcd(std::vector<long long> &v) {
    long long ans = v[0];
    for (int i = 1; i < (int)v.size(); ++i) {
        ans = gcd(ans, v[i]);
    }
    return ans;
}

// aとbの最小公倍数 O(log min(a, b))
long long lcm(long long a, long long b) {
    long long g = gcd(a, b);
    return a / g * b;
}

const int INF = 1u << 30u;
const long long LINF = 1ull << 58u;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
const std::vector<int> dy2 = {0, 1}, dx2 = {1, 0};  // 右，下
const std::vector<int> dy4 = {0, 1, 0, -1}, dx4 = {1, 0, -1, 0};    // 右，下，左，上
const std::vector<int> dy8 = { 0, -1, 0, 1, 1, -1, -1, 1 }, dx8 = { 1, 0, -1, 0, 1, 1, -1, -1 };

using namespace std;

// strをdelimiterで分割する
vector<string> split(const string &str, const string &delimiter) {
    vector<string> res;
    size_t current = 0, found, delimlen = delimiter.size();
    while ((found = str.find(delimiter, current)) != string::npos) {
        res.emplace_back(string(str, current, found - current));
        current = found + delimlen;
    }
    res.emplace_back(string(str, current, str.size() - current));
    return res;
}

class Edge {
public:
    const int no = 0;
    const int from = 0;
    const int to = 0;
    const long long weight = 0;

    Edge(int no, int from, int to, long long weight) : no(no), from(from), to(to), weight(weight) {
    }

};

class Graph {
public:
    const int N;    // ノード数
    int M = 0;      // エッジ数
    std::vector<std::vector<Edge>> graph;
    Graph(int N) : N(N) {
        this->graph.resize(N);
    }

    void add_undirected_edge(const int no, const int u, const int v, const long long w) {
        this->graph.at(u).emplace_back(Edge(no, u, v, w));
        this->graph.at(v).emplace_back(Edge(no, v, u, w));
        this->M++;
    }

    void add_directed_edge(const int no, const int from, const int to, const long long w) {
        this->graph.at(from).emplace_back(Edge(no, from, to, w));
        this->M++;
    }

    std::vector<Edge> &operator[](const int u) {
        return this->graph[u];
    }

    std::vector<std::vector<long long>> make_matrix_graph() {
        std::vector<std::vector<long long>> matrix(this->N, std::vector<long long>(this->N, INT_MAX));
        for (const auto &v : this->graph) {
            for (const auto &e : v) {
                matrix[e.from][e.to] = e.weight;
            }
        }
        return matrix;
    }

    // mode 0: undirected edge
    // mode 1: directed edge
    void show(int mode = 0) {
        std::cout << this->M << std::endl;
        for (const auto &v : this->graph) {
            for (const auto &e : v) {
                if (mode == 0) {
                    if (e.from < e.to) {
                        std::cout << e.from << " " << e.to << std::endl;
                    }
                }
                else {
                    std::cout << e.from << " " << e.to << std::endl;
                }
            }
        }
    }
};

void dfs(int u, int i, const int base, vector<int> &color, Graph &graph) {
    color[u] = base + (i % 2);
    FOE(e, graph[u]) {
        if (color[e.to] == -1) {
            dfs(e.to, i + 1, base, color, graph);
        }
    }
}

/**
 * 全ノード間の最短距離をもとめる
 * matrix[i][j]には辺e=(i,j)のコスト(辺が存在しない場合はINF)
 * 負の閉路がある場合は空を返す
 * O(|V|^3)
 */
std::vector<std::vector<int>> warshall_floyd(std::vector<std::vector<int>> matrix) {
    const unsigned long num_node = matrix.size();

    // 自分の距離は0
    for (int i = 0; i < num_node; ++i) {
        matrix.at(i).at(i) = 0;
    }

    for (int m = 0; m < num_node; ++m) {
        for (int s = 0; s < num_node; ++s) {
            for (int e = 0; e < num_node; ++e) {
                // sからeへmを経由して到達可能
                if (matrix.at(s).at(m) != INF and matrix.at(m).at(e) != INF) {
                    matrix.at(s).at(e) = std::min(matrix.at(s).at(e), matrix.at(s).at(m) + matrix.at(m).at(e));
                }
            }
        }
    }

    // 負閉路チェック
    for (int u = 0; u < num_node; ++u) {
        if (matrix.at(u).at(u) < 0) {
            return {};
        }
    }

    return matrix;
}


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

    while (true) {
        LL N;
        cin >> N;

        if (N == 0) {
            return 0;
        }

        int no = 0;
        unordered_map<string, int> name_no;
        vector<pair<int, int>> edges;
        FOR(i, 0, N) {
            string S;
            cin >> S;
            auto p = split(S, "-");
            string a = p[0];
            string b = p[1];

            if (name_no.find(a) == name_no.end()) {
                name_no[a] = no;
                no++;
            }

            if (name_no.find(b) == name_no.end()) {
                name_no[b] = no;
                no++;
            }
            edges.emplace_back(make_pair(name_no[a], name_no[b]));
        }

        Graph graph(no);
        auto g = make_v<int>(no, no);
        std::vector<std::vector<int>> matrix(no, vector<int>(no, INF));
        FOE(p, edges) {
            graph.add_undirected_edge(0, p.first, p.second, 1);

            g[p.first][p.second] = 1;
            g[p.second][p.first] = 2;
            matrix[p.first][p.second] = 1;
        }

        auto color = make_v<int>(no);
        fill_v(color, -1);
        int base = 0;
        FOR(i, 0, no) {
            if (color[i] == -1) {
                dfs(i, 0, base, color, graph);
                base += 4;
            }
        }

        FOR(a, 0, no) {
            FOR(b, a + 1, no) {

                bool found1 = false, found2 = false, found3 = false;
                FOR(c, 0, no) {
                    if (a == b or a == c or b == c) {
                        continue;
                    }

                    if (g[a][c] and g[b][c]) {
                        found1 = true;
                    }

                    if (g[c][a] == 1 and g[b][c] == 1) {
                        found2 = true;
                    }

                    if (g[a][c] == 1 and g[c][b] == 1) {
                        found3 = true;
                    }
                }

                if (found1 and not found2 and not found3) {
                    matrix[a][b] = 1;
                    matrix[b][a] = 1;
                }
            }
        }

        auto cost = warshall_floyd(matrix);

        print(no);
        LL M;
        cin >> M;
        FOR(i, 0, M) {
            string S;
            cin >> S;
            auto p = split(S, "-");
            string a = p[0];
            string b = p[1];

            if (name_no.find(a) == name_no.end()) {
                print("NO");
                continue;
            }

            if (name_no.find(b) == name_no.end()) {
                print("NO");
                continue;
            }

            int u = name_no[a];
            int v = name_no[b];

            if (abs(color[u] - color[v]) != 1) {
                print("NO");
                continue;
            }

            if (cost[u][v] != INF) {
                print("YES");
            }
            else {
                print("NO");
            }

        }

    }

    return 0;
}




Measured memory_bytes: 3652